Halting of quantum turing machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2509, Issue , 2002, Pages 58-65

  Ozawa, Masanao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MACHINERY;

HALTING PROBLEMS; QUANTUM TURING MACHINE;

TURING MACHINES;

EID: 79551665541     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45833-6_6     Document Type: Conference Paper

References (9)

1. D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond., A 400:97–117, (1985).
2. D. Deutsch. Quantum computational networks. Proc. R. Soc. Lond., A 425:73–90, (1989).
3. P. W. Shor. Algorithms for quantum computation: Discrete logarithms and factoring. In G. Goldwasser, editor, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 124–134, Los Alamitos, CA, 1994. IEEE Computer Society Press.
4. J. M. Myers. Can a universal quantum computer be fully quantum? Phys. Rev. Lett., 78:1823–1824, (1997).
5. M. Ozawa. Quantum nondemolition monitoring of universal quantum computers. Phys. Rev. Lett., 80:631–634, (1998).
6. M. Ozawa. Quantum Turing machines: Local transition, preparation, measurement, and halting. In P. Kumar, G. M. D’Ariano, and O. Hirota, editors, Quantum Communication, Computing,and Measurement 2, pages 233–241, New York, (2000). Kluwer/Plenum.
7. N. Linden and S. Popescu. The halting problem for quantum computers. Eprint: quant-ph/9806054, 16 June 1998.
8. E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM J. Comput., 26:1411–1473, (1997).
9. H. Nishimura and M. Ozawa. Computational complexity of uniform quantum circuit families and quantum Turing machines. Theoret. Comput. Sci., 276:147–181, (2002).