Proceedings of the Royal Society of London Series A Mathematical and Physical Sciences · 1995 · 222 citations · 8 references
ComputingComputer SciencePhysicsQuantum ComputingQuantum MechanicsTheory Of ComputationQuantum BitsQuantum CircuitsQuantum ComputationQuantum GatesElementary Quantum GatesMulti-qubit GatesQuantum Circuit ConstructionTwo-qubit GatesUniversal Gate SetsUniversal Quantum Computation
The authors aim to prove the existence of a class of two‑input, two‑output gates that are universal for quantum computation. They explicitly construct Deutsch’s three‑bit gate as a network of replicas of a single two‑bit gate. They succeed in proving that such gates exist and are universal for quantum computation. Published in the Proceedings of the Royal Society of London.
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.
8
Two-bit gates are universal for quantum computation
David P. DiVincenzo · Physical Review A · 1995 · 1.1K citations · Full text
Computing, Computer Science, Physics +17
Teleportation of an atomic state between two cavities using nonlocal microwave fields
L. Davidovich, N. Zagury, M. Brune et al. · Physical Review A · 1994 · 386 citations