论文信息 - Basic Properties of Quantum Automata

Basic Properties of Quantum Automata

This paper develops a theory of quantum automata and their slightly more general versions, q-automata. Quantum languages and η-quantum languages, 0≤η<1, are studied. Functions that can be realized as probability maps for q-automata are characterized. Quantum grammars are discussed and it is shown that quantum languages are precisely those languages that are induced by a quantum grammar. A quantum pumping lemma is employed to show that there are regular languages that are not η-quantum, 0≤η<1.

Stanley Gudder | S. Gudder

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

[2] Daniel R. Simon. On the Power of Quantum Computation , 1997, SIAM J. Comput..

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

[4] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[5] Andrew Steane,et al. Active Stabilization, Quantum Computation, and Quantum State Synthesis , 1997 .

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

[7] R. Feynman. Quantum mechanical computers , 1986 .

[8] DiVincenzo. Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[9] Barenco,et al. Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[10] P. Benioff. Quantum Mechanical Models of Turing Machines That Dissipate No Energy , 1982 .

[11] Gilles Brassard,et al. Oracle Quantum Computing , 1994 .