Exact results for accepting probabilities of quantum automata
| dc.creator | Ambainis, Andris | |
| dc.creator | Kikusts, Arnolds | |
| dc.date | 2001-09-26 | |
| dc.date | 2002-03-11 | |
| dc.date.accessioned | 2026-07-07T06:02:44Z | |
| dc.date.available | 2026-07-07T06:02:44Z | |
| dc.description | 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... | |
| dc.description | 26 pages, 4 figures, submitted to Theoretical Computer Science (earlier version at STACS'01) | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0109136 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0109136 | |
| dc.identifier | Theoretical Computer Science, 295(2003):3-25 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/89723 | |
| dc.subject | Quantum Physics | |
| dc.title | Exact results for accepting probabilities of quantum automata | |
| dc.type | text |