On Computational Power of Quantum Branching Programs
In this paper we introduce a model of a Quantum Branching Program (QBP) and study 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(2n), contrary to the analogous situation for quantum finite automata. Further we display certain symmetric Boolean function which is computable by a read-once QBP with O(logn) width, which requires a width Ω(n) on any deterministic read-once BP and (classical) randomized read-once BP with permanent transitions in each levels.
We present a general lower bound for the width of read-once QBPs, showing that the upper bound for the considered symmetric function is almost tight.
KeywordsBoolean Function Regular Language Pure Quantum State Symmetric Boolean Function Quantum Part
Unable to display preview. Download preview PDF.
- 2.F. Ablayev and M. Karpinski, A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs, ECCC TR98-011 (1998), available at http://www.eccc.uni-trier.de/eccc/.
- 3.P. Alexandrov, Introduction to set theory and general topology, Berlin, 1984.Google Scholar
- 4.A. Ambainis and R. Freivalds, 1-way quantum finite automata: strengths, weaknesses and generalization, In Proceeding of the 39th IEEE Conference on Foundation of Computer Science, 1998, 332–342. See also quant-ph/9802062 v3.Google Scholar
- 8.R. Freivalds, Quantum finite automata, Manuscript 2000, personal communication.Google Scholar
- 9.A. Kondacs and J. Watrous. On the power of quantum finite state automata. In proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997, 66–75.Google Scholar