Decoding color codes by projection onto surface codes

Maximum matching and a polyhedron with 0-1 vertices

Edmonds, J · 1965

Earlier work this paper cites.

Path, trees, and flowers

Edmonds, J · 1965

Earlier work this paper cites.

Algorithm 447: Efficient algorithms for graph manipulation

Hopcroft, J., and Tarjan, R · 1973

Earlier work this paper cites.

Computers and intractability: A guide to the theory of NP-completeness

Johnson, D., and Garey, M · 1979

Earlier work this paper cites.

Good quantum error-correcting codes exist

Calderbank, A., and Shor, P · 1996

Earlier work this paper cites.

Multiple-particle interference and quantum error correction

Steane, A · 1996

Earlier work this paper cites.

Topological quantum memory

Dennis, E., Kitaev, A., Landahl, A., and Preskill, J · 2002

Earlier work this paper cites.

Algebraic topology

Hatcher, A · 2002

Earlier work this paper cites.

Fault-tolerant quantum computation by anyons

Kitaev, A · 2003

Earlier work this paper cites.

Sparse-graph codes for quantum error correction

MacKay, D. J. C., Mitchison, G., and McFadden, P. L · 2004

Earlier work this paper cites.

Topological quantum distillation

Bombin, H., and Martin-Delgado, M · 2006

Earlier work this paper cites.

Homological error correction: Classical and quantum codes

Bombin, H., and Martin-Delgado, M · 2007

Cited alongside, same era.

On the iterative decoding of sparse quantum codes

Poulin, D., and Chung, Y · 2008

Cited alongside, same era.

Error threshold for color codes and random three-body ising models

Katzgraber, H. G., Bombin, H., and Martin-Delgado, M · 2009

Cited alongside, same era.

Blossom V: a new implementation of a minimum cost perfect matching algorithm

Kolmogorov, V · 2009

Cited alongside, same era.

Accuracy thresholds of topological color codes on the hexagonal and square-octagonal lattices

Ohzeki, M · 2009

Cited alongside, same era.

Quantum LDPC codes with positive rate and minimum distance proportional to n 1 / 2 n^{1/2} ;

Tillich, J.-P., and Zémor, G · 2009

Fault-tolerant quantum computing with color codes

Original

Landahl, A. J., Anderson, J. T., and Rice, P. R · 2011

Later among the works it cites.

Strong resilience of topological codes to depolarization

Bombin, H., Andrist, R. S., Ohzeki, M., Katzgraber, H. G., and Martin-Delgado, M · 2012

Later among the works it cites.

Universal topological phase of two-dimensional stabilizer codes

Bombin, H., Duclos-Cianci, G., and Poulin, D · 2012

Later among the works it cites.

Towards practical classical processing for the surface code

Fowler, A., Whiteside, A., and Hollenberg, L · 2012

Later among the works it cites.

Efficient decoding of topological color codes

Sarvepalli, P., and Raussendorf, R · 2012

Later among the works it cites.

An application of Khovanov homology to quantum codes