One of important questions on quantum computing is whether there is a computational gap between the models that are allowed to use quantum effects and the models that are not. Several types of quantum computation models have been proposed, including quantum finite automata and quantum pushdown automata (with quantum pushdown stack). It has been shown that some quantum computation models are more powerful than classical counterparts and some are not since quantum computation models are required to obey some restrictions such as reversible state transitions. In this paper, we investigate the power of quantum pushdown automata whose stack is assumed to be implemented as a classical device, and show that they are strictly more powerful than classical counterparts in the one-sided error setting. That is, we show that there is a non-context-free language which quantum pushdown automata with classical stack operations can recognize with one-sided error. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Nakanishi, M. (2004). On the power of one-sided error quantum pushdown automata with classical stack operations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3106, 179–187. https://doi.org/10.1007/978-3-540-27798-9_21
Mendeley helps you to discover research relevant for your work.