Fetching the paper…
Reading the bibliography…
Quantum error-correcting codes, such as subspace, subsystem, and Floquet codes, are typically constructed within the stabilizer formalism, which does not fully capture the idea of fault-tolerance needed for practical quantum computing applications.
“A recursive approach to low complexity codes”
R. Tanner · 1981
Earlier work this paper cites.
“Algorithms for generating fundamental cycles in a graph”
N. Deo, G. Prabhu, and M. S. Krishnamoorthy · 1982
Earlier work this paper cites.
“Fault-tolerant quantum computation”
P.W. Shor · 1996
Earlier work this paper cites.
“Stabilizer codes and quantum error correction”
D. Gottesman · 1997
Earlier work this paper cites.
“Active stabilization, quantum computation, and quantum state synthesis”
A. M. Steane · 1997
Earlier work this paper cites.
“The Heisenberg representation of quantum computers” (1998)
D. Gottesman · 1998
Earlier work this paper cites.
“Topological quantum memory”
E. Dennis, A. Y. Kitaev, A. Landahl, and J. Preskill · 2002
Earlier work this paper cites.
“Fault-tolerant quantum computation by anyons”
A. Y. Kitaev · 2003
Earlier work this paper cites.
“Improved simulation of stabilizer circuits”
S. Aaronson and D. Gottesman · 2004
Earlier work this paper cites.
“An introduction to factor graphs”
H.-A. Loeliger · 2004
Earlier work this paper cites.
“Scalable quantum computing in the presence of large detected-error rates”
E. Knill · 2005
Earlier work this paper cites.
“Fast simulation of stabilizer circuits using a graph-state representation”
S. Anders and H. J. Briegel · 2006
Earlier work this paper cites.
“Topological quantum distillation”
H. Bombin and M. A. Martin-Delgado · 2006
Earlier work this paper cites.
“Quantum accuracy threshold for concatenated distance-3 codes”
P. Aliferis, D. Gottesman, and J. Preskill · 2006
Earlier work this paper cites.
“Short Shor-style syndrome sequences” (2020)
N. Delfosse and B. W. Reichardt · 2008
Earlier work this paper cites.
“An introduction to quantum error correction and fault-tolerant quantum computation” (2009)
D. Gottesman · 2009
Earlier work this paper cites.
“Surface codes: Towards practical large-scale quantum computation”
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland · 2012
Earlier work this paper cites.
“Surface code quantum computing by lattice surgery”
D. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter · 2012
Cited alongside, same era.
“Quantum error correction for quantum memories”
B. M. Terhal · 2015
Cited alongside, same era.
“Roads towards fault-tolerant universal quantum computation”
E. T. Campbell, B. M. Terhal, and C. Vuillot · 2017
Cited alongside, same era.
“The European quantum technologies roadmap”
A. Acin, I. Bloch, H. Buhrman, T. Calarco, C. Eichler, J. Eisert, J. Esteve, N. Gisin, S. J. Glaser, F. Jelezko, S. Kuhr, M. Lewenstein, M. F. Riedel, P. O. Schmidt, R. Thew, A. Wallraff, I. Walmsley, and F. K. Wilhelm · 2018
Cited alongside, same era.
“Quantum error correction: an introductory guide”
J. Roffe · 2019
Cited alongside, same era.
“Simulation of qubit quantum circuits via Pauli propagation”
P. Rall, D. Liang, J. Cook, and W. Kretschmer · 2019
Cited alongside, same era.
“Universal quantum computing with twist-free and temporally encoded lattice surgery”
C. Chamberland and E. T. Campbell · 2022
Later among the works it cites.
“Stability experiments: The overlooked dual of memory experiments”
C. Gidney · 2022
Later among the works it cites.
“Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching”
O. Higgott · 2022
Later among the works it cites.
“Relaxing hardware requirements for surface Code circuits using time-dynamics”
M. McEwen, D. Bacon, and C. Gidney · 2023
Later among the works it cites.
“Spacetime codes of clifford circuits” (2023)
Nicolas Delfosse and Adam Paetznick · 2023
Later among the works it cites.
“Correcting non-independent and non-identically distributed errors with surface codes”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“A game of surface codes: Large-scale quantum computing with lattice surgery”
D. Litinski · 2019
Cited alongside, same era.
“Topological and subsystem codes on low-degree graphs with flag qubits”
C. Chamberland, G. Zhu, T. J. Yoder, J. B Hertzberg, and A. W. Cross · 2020
Cited alongside, same era.
“Stim: a fast stabilizer circuit simulator”
C. Gidney · 2021
Cited alongside, same era.
“The XZZX surface code”
J. Pablo Bonilla-Ataides, David K. Tuckett, S. D. Bartlett, S. T. Flammia, and B. J. Brown · 2021
Cited alongside, same era.
“Practical quantum error correction with the XZZX code and Kerr-cat qubits”
A. S. Darmawan, B. J. Brown, A. L. Grimsmo, D. K. Tuckett, and S. Puri · 2021
Cited alongside, same era.
“Beyond single-shot fault-tolerant quantum error correction”
N. Delfosse, B. W Reichardt, and K. M. Svore · 2021
Cited alongside, same era.
K. Tiurev, P.-J. H. S. Derks, J. Roffe, J. Eisert, and J.-M. Reiner · 2023
Later among the works it cites.
“Bias-tailored quantum LDPC codes”
J. Roffe, L. Z. Cohen, A. O. Quintivalle, D. Chandra, and E. T. Campbell · 2023
Later among the works it cites.
“Improved decoding of circuit noise and fragile boundaries of tailored surface codes”
O. Higgott, T. C. Bohdanowicz, A. Kubica, S. T. Flammia, and E. T. Campbell · 2023
Later among the works it cites.
“Unifying flavors of fault tolerance with the ZX calculus”
H. Bombin, D. Litinski, N. Nickerson, F. Pastawski, and S. Roberts · 2024
Closest in time.
“Floquetifying stabiliser codes with distance-preserving rewrites” (2024)
B. Rodatz, B. Poór, and A. Kissinger · 2024
Closest in time.
“Clifford-deformed surface codes”
A. Dua, A. Kubica, L. Jiang, S. T. Flammia, and M. J. Gullans · 2024
Closest in time.
“Domain wall color code”
K. Tiurev, A. Pesah, P.-J. H. S. Derks, J. Roffe, J. Eisert, M. S. Kesselring, and J.-M. Reiner · 2024
Closest in time.
“Anyon condensation and the color code”
M. S Kesselring, J. C. Magdalena de la Fuente, F. Thomsen, J. Eisert, S. D. Bartlett, and B. J. Brown · 2024
Closest in time.
“Distance-four quantum codes with combined postselection and error correction”
P. Prabhu and B. W. Reichardt · 2024
Closest in time.
“Sparse Blossom: correcting a million errors per core second with minimum-weight matching”
Oscar Higgott and Craig Gidney · 2025
Closest in time.
“ XYZ \mathrm{XYZ} ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime”
Julio C. Magdalena de la Fuente, Josias Old, Alex Townsend-Teague, Manuel Rispler, Jens Eisert, and Markus Müller · 2025
Closest in time.