Fault-tolerant quantum computing with color codes

E. Berlekamp, R. J. McEliece, and H. van Tilborg, On the inherent intractability of certain coding problems , IEEE Trans. Info. Theo. 24

1978

Earlier work this paper cites.

H. Nishimori, Internal energy, specific-heat and correlation-function of the bond-random Ising-model , Prog. Theor. Phys. 66

1981

Earlier work this paper cites.

H. Nishimori, Geometry-induced phase transition in the ± j \pm j Ising model , J. Phys. Soc. Japan 55

1986

Earlier work this paper cites.

P. W. Shor, Fault-tolerant quantum computation , in Proceedings of the 37th Annual Symposium on Foundations of Computer Science , edited by R. S. Sipple, IEEE (IEEE Press, Los Alamitos, CA, 14–16 Oct. 1996, Burlington, VT, USA, 1996), pp. 56–65, ISBN 0-8186-7594-2, doi:10.1137/S0097539795293172 , arXiv:quant-ph/9605011

1996

Earlier work this paper cites.

A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist , Phys. Rev. A 54

1996

Earlier work this paper cites.

E. Knill, R. Laflamme, and W. H. Zurek, Threshold accuracy for quantum computation (1996), arXiv:quant-ph/9610011

1996

Earlier work this paper cites.

D. Aharonov and M. Ben-Or, Fault tolerant quantum computation with constant error , in Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing , edited by F. T. Leighton and P. Shor (ACM Press, New York, El Paso, TX, USA, 1997), pp. 176–188, ISBN 0-89791-888-6, See also extended version [ 3 ] ., doi:10.1145/258533.258579 , arXiv:quant-ph/9611025

1997

Earlier work this paper cites.

A. M. Steane, Active stabilization, quantum computation, and quantum state synthesis , Phys. Rev. Lett. 78

1997

Earlier work this paper cites.

D. Gottesman, Stabilizer codes and quantum error correction , Ph.D. thesis, Caltech (1997), arXiv:quant-ph/9705052

1997

Earlier work this paper cites.

E. Knill, R. Laflamme, and W. H. Zurek, Resilient quantum computation: Error models and thresholds , Proc. Roy. Soc. London A 454

1998

Earlier work this paper cites.

A. M. Steane, Space, time, parallelism and noise requirements for reliable quantum computing , Fortschr. Phys. 46

1998

Earlier work this paper cites.

I. Jensen and A. J. G. and, Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices , J. Phys. A: Math. Gen. 31

1998

Earlier work this paper cites.

D. Aharonov and M. Ben-Or, Fault tolerant quantum computation with constant error rate (1999), See also condensed version [ 2 ] ., arXiv:quant-ph/9906129

1999

Earlier work this paper cites.

D. Gottesman, The Heisenberg representation of quantum computers , in Group22: Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics , edited by S. P. Corney, R. Delbourgo, and P. D. Jarvis (International Press, Cambridge, MA, 13–17 Jul. 1998, Hobart, Australia, 1999), pp. 32–43, arXiv:quant-ph/9807006

1999

Earlier work this paper cites.

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000), ISBN 0-521-63235-8 (Hardback), 0-521-63503-9 (Paperback)

2000

Earlier work this paper cites.

E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory , J. Math. Phys. 43

2002

Earlier work this paper cites.

C. Wang, J. Harrington, and J. Preskill, Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory , Ann. Phys. 303

2003

Earlier work this paper cites.

T. Ohno, G. Arakawa, I. Ichinose, and T. Matsui, Phase structure of the random-plaquette z 2 z_{2} gauge model: accuracy threshold for a toric quantum memory , Nucl. Phys. B 697

2004

Earlier work this paper cites.

I. Jensen, Improved lower bounds on the connective constants for two-dimensional self-avoiding walks , J. Phys. A: Math. Gen. 37

2004

Earlier work this paper cites.

J. Feldman, M. J. Wainwright, and D. R. Karger, Using linear programming to decode binary linear codes , IEE Trans. Info. Theo. 51

2004

Earlier work this paper cites.

E. Knill, Quantum computing with realistically noisy devices , Nature 434

2005

Cited alongside, same era.

S. E. Alm, Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices , J. Phys. A: Math. Gen. 38

2005

Cited alongside, same era.

S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas , Phys. Rev. A 71

2005

Cited alongside, same era.

S. Virmani, S. F. Huelga, and M. B. Plenio, Classical simulability, entanglement breaking, and quantum computation thresholds , Phys. Rev. A 71

2005

Cited alongside, same era.

D. Poulin, Stabilizer formalism for operator quantum error correction , Phys. Rev. Lett 95

2005

Cited alongside, same era.

F. M. Spedalieri and V. P. Roychowdhury, Latency in local, two-dimensional, fault-tolerant quantum computing , Quant. Inf. Comp. 9

Original

2009

Later among the works it cites.

A. G. Fowler, A. M. Stephens, and P. Groszkowski, High-threshold universal quantum computation on the surface code , Phys. Rev. A 80

Original

2009

Later among the works it cites.

H. G. Katzgraber, H. Bombin, and M. A. Martin-Delgado, Error threshold for color codes and random three-body ising models , Phys. Rev. Lett. 103

Original

2009

Later among the works it cites.

S. L. A. de Queiroz, Location and properties of the multicritical point in the Gaussian and ± j \pm j Ising spin glasses , Phys. Rev. B 79

Original

2009

Later among the works it cites.

J. E. Levy, A. Ganti, C. A. Phillips, B. R. Hamlet, A. J. Landahl, T. M. Gurrieri, R. D. Carr, and M. S. Carroll, Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory , in Proceedings of the Twenty-First Annual ACM Symposium on Parallelism in Algorithms and Architectures , edited by F. Meyer auf der Heide and M. A. Bender (ACM Press, New York, 11–13 August, 2009, Calgary, AB, Canada, 2009), ISBN 978-1-60558-606-9, doi:10.1145/1583991.1584039 , arXiv:0904.0003