Quantum Real-Time Turing Machine

The principles of quantum computation differ from the principles of classical computation very much. Quantum analogues to the basic constructions of the classical computation theory, such as Turing machine or finite 1-way and 2-ways automata, do not generalize deterministic ones. Their capabilities are incomparable. The aim of this paper is to introduce a quantum counterpart for real - time Turing machine. The recognition of a special kind of language, that can't be recognized by a deterministic real - time Turing machine, is shown.

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

[2]  F. C. Hennie,et al.  On-Line Turing Machine Computations , 1966, IEEE Trans. Electron. Comput..

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

[4]  Juris Hartmanis,et al.  Computational Complexity of One-Tape Turing Machine Computations , 1968, JACM.

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