On the class of languages recognizable by 1-way quantum finite automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2010, Issue , 2001, Pages 75-86

  Ambainis, Andris ^a   Kikusts, Arnolds ^b   Valdats, Māris ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTS;

BOOLEAN OPERATIONS; QUANTUM FINITE AUTOMATA;

FINITE AUTOMATA;

EID: 84957097338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_7     Document Type: Conference Paper

References (13)

1. A. Ambainis, R. Bonner, R. Freivalds, A. Kikusts. Probabilities to accept languages by quantum finite automata. Proc. COCOON'99, Lecture Notes in Computer Science, 1627:174-183. Also quant-ph/99040664.
2. A. Ambainis, R. Freivalds. 1-way quantum finite automata: strengths, weaknesses and generalizations. Proc. FOCS'98, pp. 332-341. Also quant-ph/9802062.
3. A. Ambainis, A. Nayak, A. Ta-Shma, U. Vazirani. Dense quantum coding and a lower bound for 1-way quantum automata. Proc. STOC'99, pp. 376-383. Also quant-ph/9804043.
4. A. Ambainis, J. Watrous. Two-way finite automata with quantum and classical states. cs.CC/9911009. Submitted to Theoretical Computer Science.
5. E. Bernstein, U. Vazirani, Quantum complexity theory. SIAM Journal on Computing, 26:1411-1473, 1997.
6. A. Brodsky, N. Pippenger. Characterizations of 1-way quantum finite automata. quant-ph/9903014.
7. J. Gruska. Descriptional complexity issues in quantum computing. Journal of Automata, Languages and Combinatorics, 5:191-218, 2000.
8. J. Kemeny, J. Laurie Snell. Finite Markov Chains. Springer-Verlag, 1976.
9. A. Kikusts. A small 1-way quantum finite automaton. quant-ph/9810065.
10. A. Kondacs, J. Watrous. On the power of quantum finite state automata. Proc. FOCS'97, pp. 66-75.
11. A. Meyer, C. Thompson. Remarks on algebraic decomposition of automata. Mathematical Systems Theory, 3:110-118, 1969.
12. C. Moore, J. Crutchfield. Quantum automata and quantum grammars. Theoretical Computer Science, 237:275-306, 2000. Also quant-ph/9707031.
13. A. Nayak. Optimal lower bounds for quantum automata and random access codes. Proc. FOCS'99, pp. 369-376. Also quant-ph/9904093.