A new universal and fault-tolerant quantum basis

A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists only of two single-qubit gates (Hadamard and 1=4 z ), and one two-qubit gate (Controlled-NOT). Moreover, a new general method for fault-tolerant implementation of quantum gates like Toffoli is introduced. This method is a generalization of the methods suggested by Shor (Proc. FOCS’96, 1996, p. 56) and later by Knill et al. (Proc. Roy. Soc. London Ser. A 454 (1998) 365). © 2000 Elsevier Science B.V. All rights reserved.

[1]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[2]  H. S. Allen.  The Quantum Theory , 1928, Nature.

[3]  A. Kitaev.  Quantum computations: algorithms and error correction , 1997 .

[4]  A. Barenco.  A universal two-bit gate for quantum computation , 1995, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[5]  J. Preskill.  Reliable quantum computers , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[6]  D. Gottesman.  Theory of fault-tolerant quantum computation , 1997, quant-ph/9702029.

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

[8]  Peter W. Shor,et al.  Fault-tolerant quantum computation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[9]  Leonard M. Adleman,et al.  Quantum Computability , 1997, SIAM J. Comput..

[10]  V. Roychowdhury,et al.  On Universal and Fault-Tolerant Quantum Computing , 1999, quant-ph/9906054.

[11]  E. Knill,et al.  Accuracy threshold for quantum computation , 1996 .

[12]  J. J. Sakurai,et al.  Modern Quantum Mechanics , 1986 .

[13]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[14]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[15]  Dorit Aharonov,et al.  Fault-tolerant quantum computation with constant error , 1997, STOC '97.

[16]  H. O. Foulkes.  Abstract Algebra , 1967, Nature.

[17]  Shor,et al.  Scheme for reducing decoherence in quantum computer memory. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[18]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[19]  E. Knill,et al.  Resilient quantum computation: error models and thresholds , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[20]  Isaac L. Chuang,et al.  Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations , 1999, Nature.

[21]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[22]  E. Knill,et al.  Threshold Accuracy for Quantum Computation , 1996, quant-ph/9610011.