Results on two-bit gate design for quantum computers

We present numerical results which show how two-bit logic gates can be used in the design of a quantum computer. We show that the Toffoli gate, which is the universal gate for all classical reversible computation, can be implemented using a particular sequence of exactly five two-bit gates. An arbitrary three-bit unitary gate, which can be used to build up any arbitrary quantum computation, can be implemented exactly with six two-bit gates. The ease of implementation of any particular quantum operation is dependent upon a very nonclassical feature of the operation, its exact quantum phase factor.<<ETX>>

[1]  W. Davidon,et al.  Mathematical Methods of Physics , 1965 .

[2]  William H. Press,et al.  Numerical recipes , 1990 .

[3]  R. Landauer.  ZIG-ZAG PATH TO UNDERSTANDING , 1994 .

[4]  Peter W. Shor,et al.  Algorithms for Quantum Computation: Discrete Log and Factoring (Extended Abstract) , 1994, FOCS 1994.

[5]  C. Slichter.  Principles of magnetic resonance , 1963 .

[6]  D. Deutsch.  Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[7]  R. Landauer.  Is quantum mechanics useful , 1995 .

[8]  D. Deutsch,et al.  The stabilisation of quantum computations , 1994, Proceedings Workshop on Physics and Computation. PhysComp '94.

[9]  D. Coppersmith.  An approximate Fourier transform useful in quantum factoring", IBM Research Report RC19642 ,; R. Cle , 2002, quant-ph/0201067.

[10]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

[11]  Reck,et al.  Experimental realization of any discrete unitary operator. , 1994, Physical review letters.

[12]  DiVincenzo.  Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[13]  Harald Weinfurter,et al.  Quantum Teleportation and Quantum Computation Based on Cavity QED , 1995 .