论文信息 - Halting in quantum Turing computation

Halting in quantum Turing computation

The paper considers the halting scheme for quantum Turing machines. The scheme originally proposed by Deutsch appears to be correct, but not exactly as originally intended. We discuss the result of Ozawa as well as the objections raised by Myers, Kieu and Danos and others. Finally, the relationship of the halting scheme to the quest for a universal quantum Turing machine is considered.

[1] J. Myers. CAN A UNIVERSAL QUANTUM COMPUTER BE FULLY QUANTUM , 1997 .

[2] Tien D. Kieu,et al. A no-go theorem for halting a universal quantum computer , 2001 .

[3] Lance Fortnow,et al. One complexity theorist's view of quantum computing , 2000, CATS.

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

[5] Yu Shi. Remarks on Universal Quantum Computer , 1998, quant-ph/9805083.

[6] Petrus H. Potgieter,et al. Deutsch's Universal Quantum Turing Machine (Revisited) , 2007, quant-ph/0701108.

[7] M. Ozawa. QUANTUM NONDEMOLITION MONITORING OF UNIVERSAL QUANTUM COMPUTERS , 1997, quant-ph/9704028.

[8] Umesh V. Vazirani,et al. Quantum complexity theory , 1993, STOC.

[9] P. Benioff. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines , 1980 .

[10] Masanori Ohya,et al. On Halting Process of Quantum Turing Machine , 2005, Open Syst. Inf. Dyn..

[11] Tien D. Kieu,et al. The halting problem for universal quantum computers , 1998 .