Fetching the paper…
Reading the bibliography…
The Bacon-Shor code is a quantum error correcting subsystem code composed of weight 2 check operators that admits a single logical qubit, and has distance $d$ on a $d \times d$ square lattice.
S. B. Bravyi and A. Y. Kitaev, Quantum codes on a lattice with boundary (1998), arXiv:quant-ph/9811052 [quant-ph]
1998
Earlier work this paper cites.
A. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics 303
2003
Earlier work this paper cites.
D. Poulin, Stabilizer formalism for operator quantum error correction, Phys. Rev. Lett. 95
2005
Earlier work this paper cites.
A. Kitaev, Anyons in an exactly solved model and beyond, Annals of Physics 321
2006
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, Topological quantum distillation, Physical review letters 97
2006
Earlier work this paper cites.
D. Bacon, Operator quantum error-correcting subsystems for self-correcting quantum memories, Phys. Rev. A 73
2006
Earlier work this paper cites.
N. P. Breuckmann, Quantum subsystem codes: Their theory and use (bachelor thesis) (2010)
2010
Earlier work this paper cites.
S. Bravyi, Subsystem codes with spatially local generators, Phys. Rev. A 83
2011
Earlier work this paper cites.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A 86
2012
Earlier work this paper cites.
M. Li, D. Miller, M. Newman, Y. Wu, and K. R. Brown, 2d compass codes, Phys. Rev. X 9
2019
Earlier work this paper cites.
M. B. Hastings and J. Haah, Dynamically Generated Logical Qubits, Quantum 5
2021
Earlier work this paper cites.
C. Vuillot, Planar floquet codes (2021), arXiv:2110.05348 [quant-ph]
2021
Earlier work this paper cites.
C. Gidney, M. Newman, A. Fowler, and M. Broughton, A Fault-Tolerant Honeycomb Memory, Quantum 5
2021
Earlier work this paper cites.
C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5
2021
Cited alongside, same era.
O. Higgott and N. P. Breuckmann, Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead, Physical Review X 11
2021
Cited alongside, same era.
J. Haah and M. B. Hastings, Boundaries for the Honeycomb Code, Quantum 6
2022
Cited alongside, same era.
C. Gidney, M. Newman, and M. McEwen, Benchmarking the Planar Honeycomb Code, Quantum 6
2022
Cited alongside, same era.
2022
Cited alongside, same era.
2023
Later among the works it cites.
2023
Later among the works it cites.
M. Davydova, Logical operations in floquet codes (talk at simons institute, berkeley) (2023)
2023
Later among the works it cites.
C. Gidney and D. Bacon, Less bacon more threshold (2023), arXiv:2305.12046 [quant-ph]
2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2022
Cited alongside, same era.
D. Aasen, Z. Wang, and M. B. Hastings, Adiabatic paths of hamiltonians, symmetries of topological order, and automorphism codes, Phys. Rev. B 106
2022
Cited alongside, same era.
A. Paetznick, C. Knapp, N. Delfosse, B. Bauer, J. Haah, M. B. Hastings, and M. P. da Silva, Performance of planar floquet codes with majorana-based qubits, PRX Quantum 4
2023
Cited alongside, same era.
A. Townsend-Teague, J. Magdalena de la Fuente, and M. Kesselring, Floquetifying the colour code, Electronic Proceedings in Theoretical Computer Science 384
2023
Cited alongside, same era.
2023
Cited alongside, same era.
2023
Cited alongside, same era.
Z. Zhang, D. Aasen, and S. Vijay, x x -cube floquet code: A dynamical quantum error correcting code with a subextensive number of logical qubits, Phys. Rev. B 108
2023
Cited alongside, same era.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
X. Fu and D. Gottesman, Error correction in dynamical codes (2024), arXiv:2403.04163 [quant-ph]
2024
Closest in time.
A. Bauer, x+ y floquet code: A simple example for topological quantum computation in the path-integral approach, Physical Review A 111
2025
Closest in time.
O. Higgott and C. Gidney, Sparse Blossom: correcting a million errors per core second with minimum-weight matching, Quantum 9
2025
Closest in time.