Quantum Finite Automata: A Modern Introduction

We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as a relatively simple technique to introduce quantum computation concepts to computer scientists. We also describe a modern QFA model involving superoperators that is able to simulate all known QFA and classical finite automaton variants.

[1]  Andris Ambainis,et al.  Improved constructions of quantum automata , 2009, Theor. Comput. Sci..

[2]  Jiacun Wang,et al.  Handbook of Finite State Based Models and Applications , 2012 .

[3]  Maksim Kravtsev,et al.  Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages , 2011, MFCS.

[4]  Leonard M. Adleman,et al.  Quantum Computability , 1997, SIAM J. Comput..

[5]  Shenggen Zheng,et al.  On the state complexity of semi-quantum finite automata , 2014, RAIRO Theor. Informatics Appl..

[6]  Shenggen Zheng,et al.  Two-Tape Finite Automata with Quantum and Classical States , 2011, 1104.3634.

[7]  Viliam Geffert,et al.  Classical Automata on Promise Problems , 2014, Discret. Math. Theor. Comput. Sci..

[8]  Hartmut Klauck,et al.  On quantum and probabilistic communication: Las Vegas and one-way protocols , 2000, STOC '00.

[9]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[10]  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).

[11]  Shenggen Zheng,et al.  One-Way Finite Automata with Quantum and Classical States , 2011, Languages Alive.

[12]  Arseny M. Shur,et al.  Quantum, Stochastic, and Pseudo Stochastic Languages with Few States , 2014, UCNC.

[13]  Roland Vollmar,et al.  QUANTUM FINITE AUTOMATA , 2000 .

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

[15]  Alberto Bertoni,et al.  Quantum Computing: 1-Way Quantum Automata , 2003, Developments in Language Theory.

[16]  Azaria Paz,et al.  Probabilistic automata , 2003 .

[17]  Cynthia Dwork,et al.  A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata , 1990, SIAM J. Comput..

[18]  A. C. Cem Say,et al.  Unbounded-error quantum computation with small space bounds , 2010, Inf. Comput..

[19]  Andris Ambainis,et al.  Superiority of exact quantum automata for promise problems , 2011, Inf. Process. Lett..

[20]  Abuzer Yakaryilmaz,et al.  Implications of Quantum Automata for Contextuality , 2014, CIAA.

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

[22]  Christel Baier,et al.  Probabilistic ω-automata , 2012, JACM.

[23]  Jozef Gruska,et al.  Quantum Computing , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[24]  Andris Ambainis,et al.  Algebraic Results on Quantum Automata , 2005, Theory of Computing Systems.

[25]  Mika Hirvensalo,et al.  Quantum Automata with Open Time Evolution , 2010, Int. J. Nat. Comput. Res..

[26]  Alberto Bertoni,et al.  Analogies and di"erences between quantum and stochastic automata , 2001 .

[27]  Lihua Wu,et al.  Characterizations of one-way general quantum finite automata , 2009, Theor. Comput. Sci..

[28]  Shenggen Zheng,et al.  Potential of Quantum Finite Automata with Exact Acceptance , 2014, Int. J. Found. Comput. Sci..

[29]  A. C. Cem Say,et al.  Languages recognized by nondeterministic quantum finite automata , 2009, Quantum Inf. Comput..