Some Observations on Two-Way Finite Automata with Quantum and Classical States

Two-way finite automata with quantum and classical states(2qcfa's) were introduced by Ambainis and Watrous. Though this computing model is more restricted than the usual two-way quantum finite automata(2qfa's) first proposed by Kondacs and Watrous, it is still more powerful than the classical counterpart. In this note, we focus on dealing with the operation properties of 2qcfa's. We prove that the Boolean operations (intersection, union, and complement) and the reversal operation of the class of languages recognized by 2qcfa's with error probabilities are closed; also, we verify that the catenation operation of such class of languages is closed under certain restricted condition. The numbers of states of these 2qcfa's for the above operations are presented. Some examples are included, and $\{xx^{R}|x\in \{a,b\}^{*},\#_{x}(a)=\#_{x}(b)\}$ is shown to be recognized by 2qcfa with one-sided error probability, where xRis the reversal of x, and # x (a) denotes the a's number in string x.

[1]  Andris Ambainis,et al.  On the Class of Languages Recognizable by 1-Way Quantum Finite Automata , 2001, STACS.

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

[3]  Vincent D. Blondel,et al.  Decidable and Undecidable Problems about Quantum Automata , 2005, SIAM J. Comput..

[4]  Marco Carpentieri,et al.  Regular Languages Accepted by Quantum Automata , 2001, Inf. Comput..

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

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

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

[8]  P. Benioff.  The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines , 1980 .

[9]  Daowen Qiu,et al.  Characterization of Sequential Quantum Machines , 2002 .

[10]  Harumichi Nishimura,et al.  An application of quantum finite automata to interactive proof systems , 2009, J. Comput. Syst. Sci..

[11]  Pedram Khalili Amiri,et al.  Quantum computers , 2003 .

[12]  R. Feynman.  Simulating physics with computers , 1999 .

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

[14]  Andris Ambainis,et al.  Dense quantum coding and a lower bound for 1-way quantum automata , 1998, STOC '99.

[15]  Masaki Nakanishi.  On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations , 2004, COCOON.

[16]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[17]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[18]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[19]  Cynthia Dwork,et al.  Finite state verifiers I: the power of interaction , 1992, JACM.

[20]  Farid M. Ablayev,et al.  Complexity of Quantum Uniform and Nonuniform Automata , 2005, Developments in Language Theory.

[21]  Rusins Freivalds,et al.  Probabilistic Two-Way Machines , 1981, MFCS.

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

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

[24]  H. S. Allen.  The Quantum Theory , 1928, Nature.

[25]  David Maier,et al.  Review of "Introduction to automata theory, languages and computation" by John E. Hopcroft and Jeffrey D. Ullman. Addison-Wesley 1979. , 1980, SIGA.

[26]  Archil Avaliani,et al.  Quantum Computers , 2004, ArXiv.

[27]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[28]  Alex Brodsky,et al.  Characterizations of 1-Way Quantum Finite Automata , 2002, SIAM J. Comput..

[29]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[30]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[31]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[32]  Rusins Freivalds,et al.  Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata , 1991, ICALP.

[33]  Albert G. Greenberg,et al.  A Lower Bound for Probabilistic Algorithms for Finite State Machines , 1984, J. Comput. Syst. Sci..

[34]  Kazuo Iwama,et al.  Undecidability on quantum finite automata , 1999, STOC '99.

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

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