A Simple Proof that Toffoli and Hadamard are Quantum Universal

Recently Shi proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a 'classical' set of gates quantum universal. In this note we give a few lines proof of this fact relying on Kitaev's universal set of gates, and discuss the meaning of the result.

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

[2]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

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

[4]  A. Ekert,et al.  Universality in quantum computation , 1995, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[5]  Lloyd,et al.  Almost any quantum logic gate is universal. , 1995, Physical review letters.

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

[7]  Dorit Aharonov,et al.  Polynomial simulations of decohered quantum computers , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

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

[10]  E. Knill,et al.  Resilient Quantum Computation , 1998 .

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

[12]  David P. DiVincenzo,et al.  Classical simulation of noninteracting-fermion quantum circuits , 2001, ArXiv.

[13]  Leslie G. Valiant,et al.  Quantum computers that can be simulated classically in polynomial time , 2001, STOC '01.

[14]  University of Toronto,et al.  Encoded Universality in Physical Implementations of a Quantum Computer , 2001 .

[15]  Howard E. Brandt,et al.  Quantum computation and information : AMS Special Session Quantum Computation and Information, January 19-21, 2000, Washington, D.C. , 2002 .

[16]  Yaoyun Shi.  Both Toffoli and controlled-NOT need little help to do universal quantum computing , 2003, Quantum Inf. Comput..