Abstract
We prove the following facts about the language recognition power of Kondacs-Watrous quantum finite automata in the unbounded error setting: One-way automata of this kind recognize all and only the stochastic languages. When the tape head is allowed two-way (or even "1.5-way") movement, more languages become recognizable. This leads to the conclusion that quantum Turing machines are more powerful than probabilistic Turing machines when restricted to constant space bounds. © 2009 Springer.
Cite
CITATION STYLE
Yakaryilmaz, A., & Say, A. C. C. (2009). Languages recognized with unbounded error by quantum finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5675 LNCS, pp. 356–367). https://doi.org/10.1007/978-3-642-03351-3_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
