Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata

Two quantum finite automata are equivalent if for any string x the two automata accept x with equal probability. This paper gives a polynomial-time algorithm for determining whether two measure-once one-way quantum finite automata are equivalent. The paper also gives a polynomial-time algorithm for determining whether two measure-many one-way quantum finite automata are equivalent.

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

[2]  Jozef Gruska,et al.  Descriptional Complexity Issues in Quantum Computing , 2000, J. Autom. Lang. Comb..

[3]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

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

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

[6]  John Watrous.  On quantum and classical space-bounded processes with algebraic transition amplitudes , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

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

[9]  Azaria Paz,et al.  Introduction to probabilistic automata (Computer science and applied mathematics) , 1971 .

[10]  Wen-Guey Tzeng,et al.  A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata , 1992, SIAM J. Comput..

[11]  Noam Nisan,et al.  Quantum circuits with mixed states , 1998, STOC '98.

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

[13]  A. Berthiaume.  Quantum computation , 1998 .

[14]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

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