Exact results for accepting probabilities of quantum automata

Authors:
Andris Ambainis;Arnolds Ķikusts
Affiliations:
School of Mathematics, Institute for Advanced Study, Princeton, NJ;Institute of Mathematics and Computer Science, University of Latvia, Raina bulv. 29, Riga, Latvia
Venue:
Theoretical Computer Science - Mathematical foundations of computer science
Year:
2003

Citing 9
Cited 8

Quantum Complexity Theory

SIAM Journal on Computing
Space-bounded Quantum complexity

Journal of Computer and System Sciences
Descriptional complexity issues in quantum computing

Journal of Automata, Languages and Combinatorics
Quantum automata and quantum grammars

Theoretical Computer Science
Quantum computation and quantum information

Quantum computation and quantum information
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
Probabilities to accept languages by quantum finite automata

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Quantum versus deterministic counter automata

Theoretical Computer Science
Lower Bounds for Generalized Quantum Finite Automata

Language and Automata Theory and Applications
Various Aspects of Finite Quantum Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Mathematical logic and quantum finite state automata

Theoretical Computer Science
Quantum finite automata and weighted automata

Journal of Automata, Languages and Combinatorics
Postselection finite quantum automata

UC'10 Proceedings of the 9th international conference on Unconventional computation
Quantum finite automata and logics

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Quantum automata theory – a review

Algebraic Foundations in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the properties of the Kondacs-Watrous model of quantum finite automata (QFA) is that the probability of the correct answer for a QFA cannot be amplified arbitrarily. In this paper, we determine the maximum probabilities achieved by QFAs for several languages. In particular, we show that any language that is not recognized by an RFA (reversible finite automaton) can be recognized by a QFA with probability at most 0.7726 ....