Languages Recognized with Unbounded Error by Quantum Finite Automata

Authors:
Abuzer Yakaryilmaz;A. C. Say
Affiliations:
Department of Computer Engineering, Boğaziçi University, Bebek, Turkey 34342;Department of Computer Engineering, Boğaziçi University, Bebek, Turkey 34342
Venue:
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Year:
2009

Citing 16
Cited 3

Quantum Complexity Theory

SIAM Journal on Computing
Quantum Computability

SIAM Journal on Computing
Undecidability on quantum finite automata

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Space-bounded Quantum complexity

Journal of Computer and System Sciences
Quantum automata and quantum grammars

Theoretical Computer Science
Analogies and differences between quantum and stochastic automata

Theoretical Computer Science
Characterizations of 1-Way Quantum Finite Automata

SIAM Journal on Computing
Two-way finite automata with quantum and classical states

Theoretical Computer Science - Natural computing
Lower Space Bounds for Randomized Computation

ICALP '94 Proceedings of the 21st 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
Optimal Lower Bounds for Quantum Automata and Random Access Codes

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Introduction to probabilistic automata (Computer science and applied mathematics)

Introduction to probabilistic automata (Computer science and applied mathematics)
Determining the equivalence for one-way quantum finite automata

Theoretical Computer Science
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Quantum computing: 1-way quantum automata

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Languages recognized by nondeterministic quantum finite automata

Quantum Information & Computation
Characterizations of one-way general quantum finite automata

Theoretical Computer Science
Another approach to the equivalence of measure-many one-way quantum finite automata and its application

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

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.