Fetching the paper…
Reading the bibliography…
We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes.
1902
Earlier work this paper cites.
1905
Earlier work this paper cites.
1911
Earlier work this paper cites.
J. Van Den Berg and H. Kesten, “Inequalities with applications to percolation and reliability,” J. Appl. Probab
1985
Earlier work this paper cites.
P. Gács and J. Reif, “A simple three-dimensional real-time reliable cellular array,” J. Comput. Syst. Sci
1988
Earlier work this paper cites.
IEEE Comput. Soc. Press, 1996
P. Shor, “Fault-tolerant quantum computation,” in Proceedings of 37th Conference on Foundations of Computer Science · 1996
Earlier work this paper cites.
A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A
1996
Earlier work this paper cites.
J. Preskill, “Reliable quantum computers,” Proc. R. Soc. A
1998
Earlier work this paper cites.
Y. Ozeki and N. Ito, “Multicritical dynamics for the ± J Ising model,” J. Phys. A
1998
Earlier work this paper cites.
2001
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” J. Math. Phys
2002
Earlier work this paper cites.
A. Y. Kitaev, “Fault-tolerant quantum computation by anyons,” Annals of Physics
2003
Earlier work this paper cites.
PhD thesis, Caltech, 2004
J. Harrington, Analysis of quantum error-correcting codes: symplectic lattice codes and toric codes · 2004
Earlier work this paper cites.
T. Ohno, G. Arakawa, I. Ichinose, and T. Matsui, “Phase structure of the random-plaquette Z2 gauge model: Accuracy threshold for a toric quantum memory,” Nucl. Phys. B
2004
Earlier work this paper cites.
S. D. Barrett and P. Kok, “Efficient high-fidelity quantum computation using matter qubits and linear optics,” Phys. Rev. A
2005
Earlier work this paper cites.
R. Raussendorf, J. Harrington, and K. Goyal, “A fault-tolerant one-way quantum computer,” Ann. Phys
2006
Earlier work this paper cites.
H. Bombín and M. A. Martin-Delgado, “Topological computation without braiding,” Phys. Rev. Lett
2007
Earlier work this paper cites.
K. Kieling, T. Rudolph, and J. Eisert, “Percolation, renormalization, and quantum computing with nondeterministic gates,” Phys. Rev. Lett
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
G. Duclos-Cianci and D. Poulin, “Fast decoders for topological quantum codes,” Phys. Rev. Lett
2010
Earlier work this paper cites.
R. Alicki, M. Horodecki, P. Horodecki, and R. Horodecki, “On thermal stability of topological qubit in kitaev’s 4d model,” Open Syst. Inf. Dyn
2010
Cited alongside, same era.
2011
Cited alongside, same era.
D. S. Wang, A. G. Fowler, and L. C. Hollenberg, “Surface code quantum computing with error rates over 1%,” Phys. Rev. A
2011
Cited alongside, same era.
2012
Cited alongside, same era.
Cambridge University Press, 2013
H. Bombín, “An Introduction to Topological Quantum Codes,” in Topological Codes · 2013
Cited alongside, same era.
2016
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
S. Bravyi and J. Haah, “Quantum self-correction in the 3D cubic code model,” Phys. Rev. Lett
2013
Cited alongside, same era.
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
PhD thesis, Caltech, 2018
A. Kubica, The ABCs of the Color Code: A Study of Topological Quantum Codes as Toy Models for Fault-Tolerant Quantum Computation and Quantum Phases Of Matter · 2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
B. J. Brown, “A fault-tolerant non-clifford gate for the surface code in two dimensions,” Science Advances
2020
Closest in time.