Can a Universal Quantum Computer Be Fully Quantum?
- 3 March 1997
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 78 (9) , 1823-1824
- https://doi.org/10.1103/physrevlett.78.1823
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.Keywords
This publication has 4 references indexed in Scilit:
- Quantum information processing: cryptography, computation, and teleportationProceedings of the IEEE, 1996
- Quantum computation and Shor's factoring algorithmReviews of Modern Physics, 1996
- Quantum computational networksProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1989
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985