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.
Cite
CITATION STYLE
Ambainis, A., & Ķikusts, A. (2001). Exact results for accepting probabilities of quantum automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2136, pp. 135–147). Springer Verlag. https://doi.org/10.1007/3-540-44683-4_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
