Abstract
The notion of a quantum Turing machine (QTM) is well established as a mathematical model. However, the difficulty on halting procedures has prevented us from formulating the notion of computing on an arbitrary quantum Turing machine. Here, an argument is outlined to show that any QTM can be efficiently simulated by a QTM with well-behaved halting flag. Thus, we can affirmatively solve the halting problem for QTMs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond., A 400:97–117, (1985).
D. Deutsch. Quantum computational networks. Proc. R. Soc. Lond., A 425:73–90, (1989).
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.
J. M. Myers. Can a universal quantum computer be fully quantum? Phys. Rev. Lett., 78:1823–1824, (1997).
M. Ozawa. Quantum nondemolition monitoring of universal quantum computers. Phys. Rev. Lett., 80:631–634, (1998).
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.
N. Linden and S. Popescu. The halting problem for quantum computers. Eprint: quant-ph/9806054, 16 June 1998.
E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM J. Comput., 26:1411–1473, (1997).
H. Nishimura and M. Ozawa. Computational complexity of uniform quantum circuit families and quantum Turing machines. Theoret. Comput. Sci., 276:147–181, (2002).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ozawa, M. (2002). Halting of Quantum Turing Machines. In: Unconventional Models of Computation. UMC 2002. Lecture Notes in Computer Science, vol 2509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45833-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-45833-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44311-7
Online ISBN: 978-3-540-45833-3
eBook Packages: Springer Book Archive