One of important questions on quantum computing is whether there is a computational gap between the model that may use quantum eects 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.
CITATION STYLE
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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1858, pp. 467–476). Springer Verlag. https://doi.org/10.1007/3-540-44968-x_46
Mendeley helps you to discover research relevant for your work.