Universality in quantum computation
- 8 June 1995
- journal article
- Published by The Royal Society in Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
- Vol. 449 (1937) , 669-677
- https://doi.org/10.1098/rspa.1995.0065
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.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- A universal two-bit gate for quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1995
- Conditional Quantum Dynamics and Logic GatesPhysical Review Letters, 1995
- Two-bit gates are universal for quantum computationPhysical Review A, 1995
- Quantum complexity theoryPublished by Association for Computing Machinery (ACM) ,1993
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Quantum cryptography using any two nonorthogonal statesPhysical Review Letters, 1992
- Quantum cryptography based on Bell’s theoremPhysical Review Letters, 1991
- 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
- Conjugate codingACM SIGACT News, 1983