Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review Letters

Can a Universal Quantum Computer Be Fully Quantum?

John M. Myers

Published Mar 3, 1997• 59 citations
Publisher

Abstract

A conflict is pointed out in the definition of a universal quantum computer between the need for a halt qubit and the need for operating on superpositions of states of a computational basis.Received 3 December 1996DOI:https://doi.org/10.1103/PhysRevLett.78.1823©1997 American Physical Society

DOI
10.1103/physrevlett.78.1823

Related papers

Toward a Universal Quantum Computer

Yu Shi

Given the existence of a universal quantum Turing machine, there is no conflict in the definition of a universal quantum computer between being universal and the need for a halt qubit, as previously claimed. It is also pointed out that there exists a universal, i.e. programmable, quantum circuit which can perform an arbitrary quantum computation, by repeating the operation of a fixed gate array.

•Aug 24, 1999•0 citations

Benassiet al.Reply

P. Benassi, Michael H. Krisch, C. Masciovecchio +5 more

A Reply to the Comment by M. Foret, et al.Received 10 December 1996DOI:https://doi.org/10.1103/PhysRevLett.78.4670©1997 American Physical Society

Physical Review Letters•Jun 16, 1997•21 citations

Lagrange Method in Reflection Positivity in the Spin Space

Shun-Qing Shen

A Comment on the Letter by Takashi Yanagisawa and Yukihiro Shimoi, Phys. Rev. Lett. 74, 4939 (1995).Received 26 December 1996DOI:https://doi.org/10.1103/PhysRevLett.79.1781©1997 American Physical Society

Physical Review Letters•Sep 1, 1997•2 citations

Universality in quantum computation

David Elieser Deutsch, Adriano Barenco, Artur Ekert

Abstract We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates.

arXiv:quant-ph/9505018•Proceedings of the Royal Society of London Series A Mathematical and Physical Sciences•Jun 8, 1995•346 citations

The halting problem for universal quantum computers

Tien D. Kieu, Michael Danos

The halting of universal quantum computers is shown to be incompatible with the constraint of unitarity of the dynamics.

arXiv:quant-ph/9811001•Nov 2, 1998•4 citations

Universality among Scalar Spin Systems

George Allen Baker Jr., James D. Johnson

Received 11 December 1984DOI:https://doi.org/10.1103/PhysRevLett.54.2461©1985 American Physical Society

Physical Review Letters•Jun 3, 1985•9 citations
A conflict is pointed out in the definition of a universal quantum computer between the need for a halt qubit and the need for operating on superpositions of states of a computational basis.Received 3 December 1996DOI:https://doi.org/10.1103/PhysRevLett.78.1823©1997 American Physical Society