Abstract
One of important questions on quantum computing is whether there is a computational gap between the model that may use quantum effects and the model that may not. Researchers have shown that some quantum automaton models are more powerful than classical ones. As one of classical computational models, branching programs have been studied intensively as well as automaton models, and several types of branching programs are introduced including read-once branching programs and bounded-width branching programs. In this paper, we introduce a new quantum computational model, a quantum branching program, as an extension of a classical probabilistic branching program, and make comparison of the power of these two models. We show that, under a bounded-width restriction, ordered quantum branching programs can compute some function that ordered probabilistic branching programs cannot compute.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Ambainis and R. Freivalds, “1-way quantum finite automata: strengths, weakness and generalizations,” Proc. 39th Symp. on Foundations of Computer Science, pp. 332–341, 1998.
L. Grover, “A fast quantum mechanical algorithm for database search,” Proc. 28th Symp. on the Theory of Computing, pp. 212–219, 1996.
A. Kondacs and J. Watorus, “On the power of quantum finite state automata,” Proc. 38th Symp. on Foundations of Computer Science, pp. 66–75, 1997.
C. Meinel, “Modified branching programs and their computational power,” Lecture Notes in Computer Science 370, Springer-Verlag, Berlin, 1989.
P. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” Proc. 35th Symp. on Foundations of Computer Science, pp. 124–134, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakanishi, M., Hamaguchi, K., Kashiwabara, T. (2000). Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_46
Download citation
DOI: https://doi.org/10.1007/3-540-44968-X_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67787-1
Online ISBN: 978-3-540-44968-3
eBook Packages: Springer Book Archive