Exact results for accepting probabilities of quantum automata

Theoretical Computer Science

Volumn 295, Issue 1-3, 2003, Pages 3-25

  Ambainis, Andris ^a   Ķikusts, Arnolds ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b UNIVERSITY OF LATVIA   (Latvia)

Author keywords

Finite automata; Quantum computation; Quantum measurement

Indexed keywords

COMPUTATIONAL METHODS; FINITE AUTOMATA; PROBABILITY; QUANTUM THEORY;

QUANTUM COMPUTATION;

COMPUTER SCIENCE;

EID: 0037463526     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00393-6     Document Type: Conference Paper

References (18)

1. 3.
2. A. Ambainis, R. Bonner, R. Freivalds, A. Ķikusts, Probabilities to accept languages by quantum finite automata. Proc. COCOON'99, pp. 174-183. Also quant-ph/9904066.
3. A. Ambainis, R. Freivalds, One-way quantum finite automata: strengths, weaknesses and generalizations, Proc. FOCS'98, pp. 332-341. Also quant-ph/9802062.
4. A. Ambainis, A. Ķikusts, M. Valdats, On the class of languages recognizable by 1-way quantum finite automata, Proc. STACS'01, pp. 75-86. Also quant-ph/0009004.
5. A. Ambainis, J. Watrous, Quantum finite automata revisited, in preparation, 2002.
6. Bernstein E., Vazirani U. Quantum complexity theory. SIAM J. Comput. 26:1997;1411-1473.
7. A, Brodsky, N. Pippenger, Characterizations of 1-way quantum finite automata, quant-ph/9903014.
8. M.P. Ciamarra, Quantum reversibility and a new type of quantum automaton, Proc. FCT'01, pp. 376-379.
9. Gruska J. Descriptional complexity issues in quantum computing. J. Automata, Languages Combin. 5:2000;191-218.
10. Kemeny J., Snell J. Finite Markov Chains. 1976;Springer, Berlin.
11. A. Ķikusts, A small 1-way quantum finite automaton, quant-ph/9810065.
12. A. Ķikusts, Z. Rasščevskis, On the accepting probabilities of 1-way quantum finite automata, Proc. Workshop on Quantum Computing and Learning, 2000, pp. 72-79.
13. A. Kondacs, J. Watrous, On the power of quantum finite state automata, Proc. FOCS'97, pp. 66-75.
14. Moore C., Crutchfield J. Quantum automata and quantum grammars. Theoret. Comput. Sci. 237:2000;275-306. Also quant-ph/9707031.
15. A. Nayak, Optimal lower bounds for quantum automata and random access codes, Proc. FOCS'99, pp. 369-376. Also quant-ph/9904093.
16. Nielsen M., Chuang I. Quantum Computation and Quantum Information. 2000;Cambridge University Press, Cambridge.
17. K. Paschen, Quantum finite automata using ancilla qubits. University of Karlsruhe, Technical Report.
18. Watrous J. Space-bounded quantum complexity. J. Comput. System Sci. 59:1999;281-326. (Preliminary version in proceedings of Complexity'98, under the title "Relationships between quantum and classical space-bounded complexity classes").