Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers

Built on

see e.g. A. Steane, Phys. Rev. A, 68
1998
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, ‘ Quantum Information and Computation
2000
Earlier work this paper cites.
R. Raussendorf and H. J. Briegel, Phys. Rev. Lett., 86
Original
2001
Earlier work this paper cites.
A. Harrow and M. Nielsen, Phys. Rev. A 68
2003
Earlier work this paper cites.
R. Jozsa and N. Linden, Proc. Roy. Soc. A 459
2003
Earlier work this paper cites.
A. A. Razborov, Quant. Inf. Comp., 4
2004
Earlier work this paper cites.

E. Knill, Nature, 434
2005
Cited alongside, same era.
S. Virmani, S. F. Huelga, and M. B. Plenio, Phys. Rev. A, 71
2005
Cited alongside, same era.
S. Bravyi, private communication, (2005)
2005
Cited alongside, same era.
S. Bravyi and A. Kitaev, Phys. Rev. A 71
2005
Cited alongside, same era.
B. Reichardt, Quant. Inf. Proc., 4
2005
Cited alongside, same era.
J. Kempe, O. Regev, F. Unger, and R. de Wolf, arXiv:0802.1464
Original
Cited in the paper.
J. Fern, arXiv:0801.2608
Original

H. Buhrman, R. Cleve, M.Laurent, N. Linden, A. Schrijver and F. Unger, Proc. 47 Symp. FOCS (2006)
2006
Later among the works it cites.
B. Reichardt, FOCS 2006, arXiv:quant-ph/0608018 (2006)
2006
Later among the works it cites.
A. Kay, Phys. Rev. A 77
2008
Closest in time.
P. Aliferis, D. Gottesman, and J. Preskill, Quant. Inf. Comp., 8
2008
Closest in time.
Ben Reichardt, private communication, (2008)
2008
Closest in time.