Quantum pushdown automata

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

Volumn 1963, Issue , 2000, Pages 336-346

  Golovkins, Marats ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA;

DETERMINISTIC PUSHDOWN AUTOMATA; PUSH-DOWN AUTOMATA; QUANTUM FINITE AUTOMATA; QUANTUM TURING MACHINE; UNITARITY;

TURING MACHINES;

EID: 84956976494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44411-4_22     Document Type: Conference Paper

References (15)

1. A. Ambainis, R. Bonner, R. Freivalds, M. Golovkins, M. Karpinski: Quantum Finite Multitape Automata. Lecture Notes in Computer Science, 1999, Vol. 1725, pp. 340-348.
2. A. Ambainis, R. Bonner, R. Freivalds, A. Kikusts: Probabilities to Accept Languages by Quantum Finite Automata. Lecture Notes in Computer Science, 1999, Vol. 1627, pp. 174-183.
3. A. Ambainis, R. Freivalds: 1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. Proc. 39th FOCS, 1998, pp. 332-341.
4. E. Bernstein, U. Vazirani: Quantum Complexity Theory. SIAM Journal on Computing, 26:1411-1473, 1997.
5. A. Brodsky, N. Pippenger: Characterizations of 1-Way Quantum Finite Automata. http://xxx.lanl.gov/abs/quant-ph/9903014.
6. D. Deutsch: Quantum Theory, the Church-Turing principle and the Universal Quantum Computer. Proc. Royal Society London, A400, 1985. pp. 96-117.
7. C. Dürr, M. Santha: A Decision Procedure for Unitary Linear Quantum Cellular Automata. Proc. 37th FOCS, 1996, pp. 38-45.
8. R. Feynman: Simulating Physics with Computers. International Journal of Theoretical Physics, 1982, vol. 21, No 6/7, pp. 467-488.
9. J. Gruska: Quantum Challenges. Lecture Notes in Computer Science, 1999, Vol. 1725, pp. 1-28.
10. E. Gurari: An Introduction to the Theory of Computation. Computer Science Press, 1989.
11. A. Kondacs, J. Watrous: On The Power of Quantum Finite State Automata. In Proc. 38th FOCS, 1997, pp. 66-75.
12. M. Kravtsev: Quantum Finite One-Counter Automata. Lecture Notes in Computer Science, 1999, Vol. 1725, pp. 431-440.
13. C. Moore, J. P. Crutchfield: Quantum Automata and Quantum Grammars. http://xxx.lanl.gov/abs/quant-ph/9707031.
14. P. W. Shor: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Proc. 35th FOCS, 1994, pp. 124-134.
15. M. Valdats: The Class of Languages Recognizable by 1-Way Quantum Finite Automata is not Closed Under Union. Proc. Quantum Computation and Learning. International Workshop, 2000, pp. 52-64. E-print: http://xxx.lanl.gov/abs/quantph/0001005.