A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On Computational Power of Quantum Branching Programs
[chapter]
2001
Lecture Notes in Computer Science
In this paper we study a model of Quantum Branching Program (QBP) and investigate its computational power. We define several natural restrictions of a general QBP model, such as a read-once and a read-k-times QBP, noting that obliviousness is inherent in a quantum nature of such programs. In particular we show that any Boolean function can be computed deterministically (exactly) by a read-once QBP in width O(2 n ), contrary to the analogous situation for quantum finite automata. Further we
doi:10.1007/3-540-44669-9_8
fatcat:ps2dy7oagrcitahfy3tynjocu4