Two-Bit Gates are Universal for Quantum Computation

Details Two-Bit Gates are Universal for Quantum Computation Two-Bit Gates are Universal for Quantum Computation

1994-07-05

arxiv.org/abs/cond-mat/9407022v1

Phys. Rev. A 51, 1015 (1995)

Physics

Condensed Matter

21 pages, REVTeX 3.0, two .ps figures available from author upon request

Scientific paper

10.1103/PhysRevA.51.1015

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.

Affiliated with

Also associated with

No associations

Rating

Two-Bit Gates are Universal for Quantum Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two-Bit Gates are Universal for Quantum Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-Bit Gates are Universal for Quantum Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-615712