论文信息 - Constructing Steane code fault-tolerant gates

Constructing Steane code fault-tolerant gates

We construct fault-tolerant approximations of rotation gates required by Shor's algorithm using only fault-tolerant gates that can be applied to the 7-qubit Steane code. A general scaling law of how rapidly these fault-tolerant approximations converge to arbitrary single-qubit gates is also determined.

Simon J. Devitt | Austin G. Fowler | Lloyd C. L. Hollenberg

[1] A. Steane. Multiple-particle interference and quantum error correction , 1996, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[2] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[3] Simon J. Devitt,et al. Implementation of Shor's algorithm on a linear nearest neighbour qubit array , 2004, Quantum Inf. Comput..

[4] B. Recht,et al. Efficient discrete approximations of quantum gates , 2001, quant-ph/0111031.

[5] А Е Китаев,et al. Квантовые вычисления: алгоритмы и исправление ошибок@@@Quantum computations: algorithms and error correction , 1997 .

[6] J. Preskill. Fault-tolerant quantum computation , 1997, quant-ph/9712048.

[7] A. Fowler,et al. Scalability of Shor’s algorithm with a limited set of rotation gates , 2003, quant-ph/0306018.

[8] Daniel Gottesman,et al. Stabilizer Codes and Quantum Error Correction , 1997, quant-ph/9705052.

[9] Austin G. Fowler,et al. Constructing arbitrary single-qubit fault-tolerant gates , 2004 .