Abstract
A very brief introduction to quantum computing with an emphasis on the distinction between universal quantum computers and quantum networks. We then prove that, under very general and desirable assumptions, it is not possible to check for halting a universal quantum computer without losing the quantum computation.
Similar content being viewed by others
References
R.P. Feynman, Optics News (1985) 11.
P. Benioff, Phys. Rev. Lett. 48 (1982) 1581.
P.W. Shor, e-print quant-ph/9508027.
A. Steane, Rep. Prog. Phys. 61 (1998) 117.
J. Preskill, Lecture Nottes on Quantum Information and Computation, California Institute of Technology.
T.D. Kieu and M. Danos, e-print quant-ph/9811001.
M. Danos and T.D. Kieu, Int. J. Mod. Phys. E8 (1999) 257.
D. Deutsch and P. Hayden, Proc. R. Soc. Lond. A456 (2000) 1759.
D. Deutsch, Proc. R. Soc. Lond A425 (1989) 73.
D. Deutsch, Proc. R. Soc. Lond. A400 (1985) 97.
J.M. Myers, Phys. Rev. Lett. 78 (1997) 1823.
Y. Shi, e-print quant-ph/9805083.
N. Linden and S. Popescu, e-print quant-ph/9806054.
M. Ozawa, Phys. Rev. Lett. 80 (1998) 631: e-print quant-ph/9809038.
T.D. Kieu, unpublished.
R.G. Cooke, Infinite Matrices and Sequence Spaces, MacMillan, London, 1950, pp. 36–37.
Author information
Authors and Affiliations
Additional information
Deceased, August 30, 1999.
Rights and permissions
About this article
Cite this article
Kieu, T.D., Danos, M. A no-go theorem for halting a universal quantum computer. APH N.S., Heavy Ion Physics 14, 217–225 (2001). https://doi.org/10.1556/APH.14.2001.1-4.21
Received:
Issue Date:
DOI: https://doi.org/10.1556/APH.14.2001.1-4.21