A universal two-bit gate for 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) , 679-683
- https://doi.org/10.1098/rspa.1995.0066
Abstract
We prove the existence of a class of two-input, two-output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three-bit gate introduced by Deutsch ( Proc . R . Soc . Lond . A 425, 73 (1989)) as a network consisting of replicas of a single two-bit gate.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Universality in quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1995
- Two-bit gates are universal for quantum computationPhysical Review A, 1995
- Teleportation of an atomic state between two cavities using nonlocal microwave fieldsPhysical Review A, 1994
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- 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
- Bicontinuous extensions of invertible combinatorial functionsTheory of Computing Systems, 1981
- A Method for Obtaining Digital Signatures and Public-Key CryptosystemsPublished by Defense Technical Information Center (DTIC) ,1978