A renormalization group decoding algorithm for topological quantum codes

J. Edmonds, “Paths, trees and flowers,” Canad. J. Math. , vol. 17, 1965

1965

Earlier work this paper cites.

S. B. Bravyi and A. Kitaev, “Quantum codes on a lattice with boundary,” arXiv:quant-ph/9811052, 1998

1998

Earlier work this paper cites.

M. Freedman and D. Meyer, “Projective plane and planar quantum codes,” Found. Comp. Math. , vol. 1, p. 325, 2001

2001

Earlier work this paper cites.

E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” J. Math. Phys. , vol. 43, p. 4452, 2002

2002

Earlier work this paper cites.

M. H. Freedman, A. Kitaev, M. Larsen, and Z. Wang, “Topological quantum computation,” Bull. Amer. Math. Soc. , vol. 40, p. 31, 2002

2002

Earlier work this paper cites.

A. Y. Kitaev, “Fault-tolerant quantum computation by anyons,” Ann. Phys. , vol. 303, p. 2, 2003

2003

Cited alongside, same era.

H. Carteret, “Rethinking renormalization for quantum phase transitions,” arXiv:quant-ph/0405168, 2004

Original

2004

Cited alongside, same era.

D. Poulin, “Optimal and efficient decoding of concatenated quantum block codes,” Phys. Rev. A , vol. 74, p. 052333, 2006

2006

Cited alongside, same era.

H. Bombin and M. Martin-Delgado, “Topological quantum distillation,” Phys. Rev. Lett. , vol. 98, p. 160502, 2007

2007

Cited alongside, same era.

R. Raussendorf and J. Harrington, “Fault-tolerant quantum computation with high threshold in two dimensions,” Phys. Rev. Lett. , vol. 98, p. 190504, 2007

2007

Later among the works it cites.

R. Raussendorf, J. Harrington, and K. Goyal, “Topological fault-tolerance in cluster state quantum computation,” New. J. Phys , vol. 9, p. 199, 2007

2007

Later among the works it cites.

S. Bravyi and R. Raussendorf, “Measurement-based quantum computation with the toric code states,” Phys. Rev. A , vol. 76, p. 022304, 2007

2007

Later among the works it cites.

G. Duclos-Cianci and D. Poulin, “Fast decoders for topological quantum codes,” Phys. Rev. Lett. , vol. 104, p. 050504, 2010

2010

Closest in time.