Two-Bit Gates are Universal for Quantum Computation
David P. Divincenzo
Abstract
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.
Create a lesson
Related papers
Knots in Condensed Matters
Y. M. Cho
Bouchaud's model exhibits two different aging regimes in dimension one
Gerard Ben Arous, Jiri Cerny
Periodic diffraction patterns for 1D quasicrystals
Pawel Buczek, Lorenzo Sadun, Janusz Wolny
Adiabatic association of ultracold molecules via magnetic field tunable interactions
Krzysztof Goral, Thorsten Koehler, Simon A. Gardiner et al.
High-Temperature Atomic Superfluidity in Lattice Boson-Fermion Mixtures
F. Illuminati, A. Albus
Constructive Methods of Invariant Manifolds for Kinetic Problems
A. N. Gorban, I. V. Karlin, A. Yu. Zinovyev