Halting in quantum Turing computation
W.L. Fouch\'e, J. Heidema, G. Jones, P.H. Potgieter
TL;DR
This paper examines the halting scheme for quantum Turing machines, analyzing its correctness, related debates, and implications for the development of a universal quantum Turing machine.
Contribution
It clarifies the correctness of Deutsch's halting scheme, discusses critiques, and explores its implications for universal quantum computation.
Findings
Deutsch's halting scheme is correct but not exactly as originally proposed
Ozawa's results support the scheme's validity
The halting scheme's role in universal quantum Turing machines is analyzed
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Computability, Logic, AI Algorithms · Quantum Information and Cryptography