Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
On the Power of Randomized Branching Programs
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Characterizations of 1-Way Quantum Finite Automata
Characterizations of 1-Way Quantum Finite Automata
Quantum and Stochastic Branching Programs of Bounded Width
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Classical and quantum parallelism in the quantum fingerprinting method
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Complexity of quantum uniform and nonuniform automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
The complexity of classical and quantum branching programs: a communication complexity approach
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
| Hi-index | 0.00 |
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 quantumfinite automata. Further we display certain symmetric Boolean function which is computable by a read-once QBP with O(log n) 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.