Current Research in Operational Quantum Logic pp 289-310 | Cite as

# Quantum Languages

## Abstract

Various languages that are accepted (or recognized) by quantum automata are discussed. For comparison, we first review the theory of classical automata. Of particular interest are the deterministic automata and the regular languages that they accept. We also consider reversible deterministic automata which accept a smaller class of languages called the reversible languages and probabilistic automata which accept a larger class. We show that reversible probabilistic automata must be deterministic. We then discuss quantum, *η*-quantum and *η*-quantum with error bound *ε* languages. These languages are compared with each other and with the regular and reversible languages and some of their properties are derived. It is shown that *η*-quantum languages with error bound *ε* must be reversible. We finally discuss two-way quantum automata and their languages and indicate why they are more powerful than deterministic automata.

## Keywords

Boolean Algebra Regular Language Stochastic Matrix Input String Input Tape## Preview

Unable to display preview. Download preview PDF.

## References

- [1]Benioff, P. (1982) Quantum Hamiltonian models of Turing machines,
*Inter-national Journal of Statistical Physics***29**, 515–546.MathSciNetADSzbMATHCrossRefGoogle Scholar - [2]Benioff, P. (1982) Quantum mechanical Hamiltonian models of Turing ma-chines that dissipate no energy,
*Physical Review Letters***48**, 1581–1585.MathSciNetADSCrossRefGoogle Scholar - [3]Bennett, C., Bernstein, E., Brassard, G. and Vazirani, U. (1997) Strengths and weaknesses of quantum computing,
*SIAM Journal of Computing***26**, 1510–1523.MathSciNetzbMATHCrossRefGoogle Scholar - [4]Bernstein, E. and Vazirani, U. (1997) Quantum complexity theory,
*SIAM Journal of Computing***26**, 1411–1473.MathSciNetzbMATHCrossRefGoogle Scholar - Deutsch, D. (1989) Quantum computational networks,
*Proceedings of the Royal Society of London***Ser. A 425**, 73–90.Google Scholar - Deutsch, D. and Jozsa, R. (1992) Rapid solution of problems by quantum computation,
*Proceedings of the Royal Society of London***Ser. A 439**, 553–558.MathSciNetADSzbMATHCrossRefGoogle Scholar - [7]Dwork, C. and Stockmeyer, L. (1990) A time-complexity gap for two-way probabilistic finite state automata,
*SIAM Journal of Computing***19**, 1011–1023.MathSciNetzbMATHCrossRefGoogle Scholar - [8]Feynman, R. (1982) Simulating physics with computers,
*International Journal of Theoretical Physics***21**, 467–488.MathSciNetADSCrossRefGoogle Scholar - [9]Feynman, R. (1986) Quantum mechanical computers,
*Foundations of Physics***16**, 507–531.MathSciNetADSCrossRefGoogle Scholar - [10]Freivalds, R. (1981) Probabilistic two-way machines, in
*Lecture Notes in Com-puter Science*, Springer-Verlag, New York, pp. 33–45.Google Scholar - [11]Grover, L. (1996) A fast quantum mechanical algorithm for database search, in
*Proceedings of the 28th Annual ACM Symposium on the Theory of Com-puting*, pp. 212–219.Google Scholar - [12]Gudder, S. (1999) Quantum automata: an overview,
*International Journal of Theoretical Physics***38**, 2261–2282.MathSciNetzbMATHCrossRefGoogle Scholar - [13]Gudder, S., Basic properties of quantum automata, To appear.Google Scholar
- [14]Kondacs, A. and Watrous, J. (1997) On the power of quantum finite state automata, in
*Proceedings of the 38th IEEE Conference on Foundations of computer Science*, pp. 66–75.Google Scholar - [15]Lewis, H. and Papadimitriou, C. (1998)
*Elements of the Theory of Computa-tion*, Prentice Hall, Englewood Cliffs, New Jersey.Google Scholar - [16]Moore, C. and Crutchfield, J., Quantum automata and quantum grammars,
*Theoretical Computer Science*, To appear.Google Scholar - [17]Paz, A. (1971)
*Introduction to Probabilistic Automata*, Academic Press, New York.zbMATHGoogle Scholar - [18]Shor, P. (1997) Polynomial-time algorithms for prime factorization and dis-crete logarithms on a quantum computer,
*SIAM Journal of Computing***26**, 1484–1509.MathSciNetzbMATHCrossRefGoogle Scholar - [19]Simon, D. (1997) On the power of quantum computation,
*SIAM Journal of Computing***26**, 1474–1483.zbMATHCrossRefGoogle Scholar - [20]Williams, C. (1999)
*Quantum Computing and Quantum Communication*, Springer-Verlag, New York.CrossRefGoogle Scholar