Quantum Computing: 1-Way Quantum Automata

In this paper we analyze several models of 1-way quantum finite automata, in the light of formal power series theory. In this general context, we recall two well known constructions, by proving: 1. Languages generated with isolated cut-point by a class of bounded rational formal series are regular. 2. If a class of formal series is closed under f-complement, Hadamard product and convex linear combination, then the class of languages generated with isolated cut-point is closed under boolean operations. We introduce a general model of 1-way quantum automata and we compare their behaviors with those of measure-once, measure-many and reversible 1-way quantum automata.

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

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

[3]  Azaria Paz,et al.  Introduction to Probabilistic Automata , 1971 .

[4]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[5]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[6]  Paavo Turakainen,et al.  Generalized automata and stochastic languages , 1969 .

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

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

[9]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

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

[11]  Gordon E. Moore,et al.  Progress in digital integrated electronics , 1975 .

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

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

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

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

[16]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[17]  R. Bellman,et al.  A Survey of Matrix Theory and Matrix Inequalities , 1965 .

[18]  M. Marcus,et al.  Introduction to linear algebra , 1966 .

[19]  Jean-Éric Pin.  On the Language Accepted by Finite Reversible Automata , 1987, ICALP.

[20]  P. Benioff.  Quantum mechanical hamiltonian models of turing machines , 1982 .

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

[22]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

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

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

[25]  Maksim Kravtsev,et al.  Probabilistic Reversible Automata and Quantum Automata , 2002, COCOON.

[26]  I PaulBenioff.  Quantum Mechanical Hamiltonian Models of Turing Machines , 1982 .

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

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

[29]  M. Marcus,et al.  A Survey of Matrix Theory and Matrix Inequalities , 1965 .

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

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