Exact Results for Accepting Probabilities of Quantum Automata

Authors:
Andris Ambainis;Arnolds Kikusts
Affiliations:
-;-
Venue:
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Year:
2001

Citing 8
Cited 0

Quantum Complexity Theory

SIAM Journal on Computing
Descriptional complexity issues in quantum computing

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

Theoretical Computer Science
Relationships Between Quantum and Classical Space-Bounded Complexity Classes

COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the properties of 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....