Phys. Rev. A 51, 1015–1022 (1995)Two-bit gates are universal for quantum computationReceived 24 June 1994; published in the issue dated February 1995 A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the universality of three-bit gates, by analogy to the universality of the Toffoli three-bit gate of classical reversible computing. Two-bit quantum gates may be implemented by magnetic resonance operations applied to a pair of electronic or nuclear spins. A ‘‘gearbox quantum computer’’ proposed here, based on the principles of atomic-force microscopy, would permit the operation of such two-bit gates in a physical system with very long phase-breaking (i.e., quantum-phase-coherence) times. Simpler versions of the gearbox computer could be used to do experiments on Einstein-Podolsky-Rosen states and related entangled quantum states. © 1995 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.51.1015
DOI:
10.1103/PhysRevA.51.1015
PACS:
03.65.Bz, 89.80.+h, 02.20.Sv, 76.70.Fz
|
