Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara. Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. In Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma, editors, Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings. Volume 1858 of Lecture Notes in Computer Science, pages 467-476, Springer, 2000. [doi]
Abstract is missing.