Automata with Quantum and Classical Resources

Quantum automata have been studied as simple quantum computation models. They can be considered models of small (or restricted)quantum computers. In this paper, we give descriptions of several kinds of quantum automata and show their power in comparison to their classical counterparts. We also give descriptions of quantum automata that have additional classical computational resources. Introducing classical computational resources can enhance the power of quantum automata, since this approach relaxes such restrictions as reversible state transitions.

[1]  Masaki Nakanishi,et al.  Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition , 2006, IEICE Trans. Inf. Syst..

[2]  Hiroshi Imai,et al.  One-way probabilistic reversible and quantum one-counter automata , 2002, Theor. Comput. Sci..

[3]  Marats Golovkins,et al.  Quantum Pushdown Automata , 2000, SOFSEM.

[4]  Maksim Kravtsev.  Quantum Finite One-Counter Automata , 1999, SOFSEM.

[5]  AmbainisAndris,et al.  Two-way finite automata with quantum and classical states , 2002 .

[6]  Tsunehiro Yoshinaga.  On the Power of Non-deterministic Quantum Finite Automata , 2002 .

[7]  Rusins Freivalds,et al.  Quantum versus Probabilistic One-Way Finite Automata with Counter , 2001, SOFSEM.

[8]  Andris Ambainis,et al.  Probabilities to Accept Languages by Quantum Finite Automata , 1999, COCOON.

[9]  John Watrous,et al.  On the power of quantum finite state automata , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[10]  Ashwin Nayak,et al.  Optimal lower bounds for quantum automata and random access codes , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[11]  Andris Ambainis,et al.  1-way quantum finite automata: strengths, weaknesses and generalizations , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[12]  Andris Ambainis,et al.  Two-way finite automata with quantum and classical state , 1999, Theor. Comput. Sci..

[13]  Andris Ambainis,et al.  Exact Results for Accepting Probabilities of Quantum Automata , 2001, MFCS.

[14]  Masaki Nakanishi,et al.  Quantum versus Classical Pushdown Automata in Exact Computation , 2005 .

[15]  James P. Crutchfield,et al.  Quantum automata and quantum grammars , 2000, Theor. Comput. Sci..

[16]  Hiroshi Imai,et al.  Quantum versus deterministic counter automata , 2005, Theor. Comput. Sci..

[17]  Daowen Qiu,et al.  Simulations of Quantum Turing Machines by Quantum Multi-Stack Machines , 2005 .