Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits

H. Cohen, A Course in Computational Algebraic Number Theory , ser. Graduate Texts in Mathematics. Springer, 1993

1993

Earlier work this paper cites.

A. Barenco, C. Bennett, R. Cleve, D. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, “Elementary gates for quantum computation,” Physical Review A , vol. 52, no. 5, pp. 3457–3467, Nov. 1995. [Online]. Available: http://arxiv.org/abs/quant-ph/9503016

1995

Earlier work this paper cites.

L. Washington, Introduction to Cyclotomic Fields , ser. Graduate Texts in Mathematics. Springer New York, 1997

1997

Earlier work this paper cites.

——, Advanced Topics in Computational Number Theory , ser. Graduate Texts in Mathematics. Springer New York, 2000

2000

Earlier work this paper cites.

M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information . New York, NY, USA: Cambridge Univ. Press, 2000

2000

Earlier work this paper cites.

A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi, Classical and Quantum Computation , ser. Graduate studies in mathematics, v. 47. Boston, MA, USA: American Mathematical Society, 2002

2002

Earlier work this paper cites.

C. M. Dawson and M. A. Nielsen, “The Solovay-Kitaev algorithm,” Quantum Information & Computation , vol. 6, no. 1, pp. 81–95, May 2005. [Online]. Available: http://arxiv.org/abs/quant-ph/0505030

2005

Earlier work this paper cites.

P. Aliferis, D. Gottesman, and J. Preskill, “Quantum accuracy threshold for concatenated distance-3 codes,” Quantum Information and Computation , vol. 6, pp. 97–165, 2006. [Online]. Available: http://arxiv.org/abs/quant-ph/0504218

2006

Earlier work this paper cites.

——, Number Theory: Volume I: Tools and Diophantine Equations , ser. Graduate Texts in Mathematics. Springer, 2007

2007

Cited alongside, same era.

K. Matsumoto and K. Amano, “Representation of quantum circuits with clifford and π / 8 \pi/8 gates,” 2008. [Online]. Available: http://arxiv.org/abs/0806.3834

Original

2008

Cited alongside, same era.

A. G. Fowler, A. M. Stephens, and P. Groszkowski, “High-threshold universal quantum computation on the surface code,” Phys. Rev. A , vol. 80, p. 052312, Nov 2009. [Online]. Available: http://arxiv.org/abs/0803.0272

Original

2009

Cited alongside, same era.

A. G. Fowler, “Constructing arbitrary steane code single logical qubit fault-tolerant gates,” Quantum Information & Computation , vol. 11, no. 9-10, pp. 867–873, Sep. 2011. [Online]. Available: http://arxiv.org/abs/quant-ph/0411206

2011

Cited alongside, same era.

N. Cody Jones, “Distillation protocols for Fourier states in quantum computing,” p. 18, Mar. 2013. [Online]. Available: http://arxiv.org/abs/1303.3066

Original

2013

Closest in time.

H. Cohen, K. Belabas et al. , “PARI/GP, a computer algebra system,” http://pari.math.u-bordeaux.fr , 1985–2013

2013

Closest in time.

G. Duclos-Cianci and K. M. Svore, “Distillation of nonstabilizer states for universal quantum computation,” Phys. Rev. A , vol. 88, p. 042325, Oct 2013. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.88.042325

2013

Closest in time.

V. Kliuchnikov, D. Maslov, and M. Mosca, “Asymptotically optimal approximation of single-qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits,” Phys. Rev. Lett. , vol. 110, p. 190502, May 2013. [Online]. Available: http://arxiv.org/abs/1212.0822

Original

2013

Closest in time.