References

Aaronson, S. and Gottesman, D. (2004). Improved simulation of stabilizer circuits. Physical Review A 70, 052328. ↩¹ ↩²
Abbe, E.; Shpilka, A. and Ye, M. (2020). Reed–Muller codes: Theory and algorithms. IEEE Transactions on Information Theory 67, 3251–3277. ↩¹ ↩² ↩³
Anderson, J. T.; Duclos-Cianci, G. and Poulin, D. (2014). Fault-tolerant conversion between the steane and reed-muller quantum codes. Physical review letters 113, 080501. ↩¹ ↩² ↩³
Arnault, F.; Gaborit, P.; Rozendaal, W.; Saussay, N. and Zémor, G. (2025). Upper Bounds on the Minimum Distance of Structured LDPC Codes, arXiv preprint arXiv:2501.19125. ↩¹ ↩² ↩³
Audenaert, K. M. and Plenio, M. B. (2005). Entanglement on mixed stabilizer states: normal forms and reduction procedures. New Journal of Physics 7, 170. ↩¹ ↩² ↩³
Aydin, A.; Delfosse, N. and Tham, E. (2025). Cyclic Hypergraph Product Code, arXiv:2511.09683 [quant-ph]. ↩¹ ↩² ↩³
Berlekamp, E. (1973). Goppa codes. IEEE Transactions on Information Theory 19, 590–592. ↩¹
Bernstein, D. J.; Lange, T. and Peters, C. (2008). Attacking and defending the McEliece cryptosystem. In: Post-Quantum Cryptography: Second International Workshop, PQCrypto 2008 Cincinnati, OH, USA, October 17-19, 2008 Proceedings 2 (Springer); pp. 31–46. ↩¹
Berthusen, N.; Dreiling, J.; Foltz, C.; Gaebler, J. P.; Gatterman, T. M.; Gresh, D.; Hewitt, N.; Mills, M.; Moses, S. A.; Neyenhuis, B.; Siegfried, P. and Hayes, D. (2024). Experiments with the four-dimensional surface code on a quantum charge-coupled device quantum computer. Physical Review A 110. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹
Berthusen, N.; Tan, S. J.; Huang, E. and Gottesman, D. (2025). Adaptive Syndrome Extraction, arXiv:2502.14835 [quant-ph]. ↩¹
Bhatia, A. S. and Kumar, A. (2018). McEliece cryptosystem based on extended Golay code, arXiv preprint arXiv:1811.06246. ↩¹
Bose, R. C. and Ray-Chaudhuri, D. K. (1960). Further results on error correcting binary group codes. Information and Control 3, 279–290. ↩¹
Bose, R. C. and Ray-Chaudhuri, D. K. (1960). On a class of error correcting binary group codes. Information and control 3, 68–79. ↩¹
Bravyi, S.; Browne, D.; Calpin, P.; Campbell, E.; Gosset, D. and Howard, M. (2019). Simulation of quantum circuits by low-rank stabilizer decompositions. Quantum 3, 181. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹
Bravyi, S.; Cross, A. W.; Gambetta, J. M.; Maslov, D.; Rall, P. and Yoder, T. J. (2024). High-threshold and low-overhead fault-tolerant quantum memory. Nature 627, 778–782. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵
Bravyi, S. and Hastings, M. B. (2013). Homological Product Codes, arXiv:1311.0885 [quant-ph]. ↩¹ ↩² ↩³ ↩⁴
Bravyi, S. and Maslov, D. (2021). Hadamard-free circuits expose the structure of the Clifford group. IEEE Transactions on Information Theory 67, 4546–4563. ↩¹ ↩² ↩³ ↩⁴ ↩⁵
Breuckmann, N. P.; Davydova, M.; Eberhardt, J. N. and Tantivasadakarn, N. (2024). Cups and Gates I: Cohomology invariants and logical quantum operations, arXiv:2410.16250 [quant-ph]. ↩¹ ↩²
Brown, W. and Fawzi, O. (Jul 2013). Short Random Circuits Define Good Quantum Error Correcting Codes. In: 2013 IEEE International Symposium on Information Theory; pp. 346–350. ↩¹ ↩²
Cain, M.; Zhao, C.; Zhou, H.; Meister, N.; Ataides, J. P.; Jaffe, A.; Bluvstein, D. and Lukin, M. D. (2025). Correlated decoding of logical algorithms with transversal gates, arXiv:2403.03272 [quant-ph]. ↩¹
Calderbank, A. R.; Rains, E. M.; Shor, P. and Sloane, N. J. (1998). Quantum error correction via codes over GF (4). IEEE Transactions on Information Theory 44, 1369–1387. ↩¹
Campbell, E. T. (2019). A theory of single-shot error correction for adversarial noise. Quantum Science and Technology 4, 025006. ↩¹ ↩² ↩³
Campbell, E. T.; Anwar, H. and Browne, D. E. (2012). Magic-state distillation in all prime dimensions using quantum reed-muller codes. Physical Review X 2, 041021. ↩¹ ↩²
Chao, R. and Reichardt, B. W. (2017). Quantum Error Correction with Only Two Extra Qubits. Physical review letters 121 5, 050502. ↩¹ ↩²
Cleve, R. and Gottesman, D. (1997). Efficient computations of encodings for quantum error correction. Physical Review A 56, 76. ↩¹ ↩² ↩³ ↩⁴
Delfosse, N. and Reichardt, B. W. (2020). Short shor-style syndrome sequences, arXiv preprint arXiv:2008.05051. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹
Dennis, E.; Kitaev, A.; Landahl, A. and Preskill, J. (2002). Topological quantum memory. Journal of Mathematical Physics 43, 4452–4505. ↩¹ ↩²
Djordjevic, I. B. (2021). Quantum information processing, quantum computing, and quantum error correction: an engineering approach (Academic Press). ↩¹ ↩²
Eberhardt, J. N. and Steffan, V. (2024). Logical operators and fold-transversal gates of bivariate bicycle codes, arXiv preprint arXiv:2407.03973. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷
Ekert, A.; Hosgood, T.; Kay, A. and Macchiavello, C. Introduction to Quantum Information Science, https://qubit.guide. ↩¹ ↩²
Ernst, D. C. (2016). An inquiry-based approach to abstract algebra. Retrieved on April 15, 2016. ↩¹ ↩² ↩³
Fowler, A. G.; Mariantoni, M.; Martinis, J. M. and Cleland, A. N. (2012). Surface codes: Towards practical large-scale quantum computation. Physical Review A 86, 032324. ↩¹ ↩²
Gallager, R. (1962). Low-density parity-check codes. IRE Transactions on Information Theory 8, 21–28. ↩¹ ↩² ↩³
Garcia, H. J.; Markov, I. L. and Cross, A. W. (2012). Efficient inner-product algorithm for stabilizer states, arXiv preprint arXiv:1210.6646. ↩¹ ↩² ↩³ ↩⁴ ↩⁵
Golay, M. J. (1949). Notes on digital coding. Proc. IEEE 37, 657. ↩¹ ↩²
Goodenough, K.; Sajjad, A.; Kaur, E.; Guha, S. and Towsley, D. (2024). Bipartite entanglement of noisy stabilizer states through the lens of stabilizer codes, arXiv:2406.02427 [quant-ph]. ↩¹ ↩²
Goppa, V. D. (1970). A new class of linear correcting codes. Problemy Peredachi Informatsii 6, 24–30. ↩¹ ↩²
Gottesman, D. (1996). Class of quantum error-correcting codes saturating the quantum Hamming bound. Physical Review A 54, 1862. ↩¹ ↩²
Gottesman, D. (1997). Stabilizer codes and quantum error correction. Ph.D. Thesis, California Institute of Technology. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸
Gottesman, D. (1998). The Heisenberg representation of quantum computers. In: International Conference on Group Theoretic Methods in Physics (Citeseer). ↩¹ ↩²
Grassl, M. (2002). Algorithmic aspects of quantum error-correcting codes. Mathematics of Quantum Computation, 223–252. ↩¹ ↩²
Grassl, M. (2011). Variations on encoding circuits for stabilizer quantum codes. In: International Conference on Coding and Cryptology (Springer); pp. 142–158. ↩¹ ↩²
Gullans, M. J.; Krastanov, S.; Huse, D. A.; Jiang, L. and Flammia, S. T. (2021). Quantum Coding with Low-Depth Random Circuits. Physical Review X 11, 031066. ↩¹ ↩²
Haah, J. (2011). Local stabilizer codes in three dimensions without string logical operators. Physical Review A?Atomic, Molecular, and Optical Physics 83, 042330. ↩¹ ↩² ↩³
Hamming, R. W. (1950). Error detecting and error correcting codes. The Bell system technical journal 29, 147–160. ↩¹ ↩²
Higgott, O. and Breuckmann, N. P. (2023). Improved Single-Shot Decoding of Higher-Dimensional Hypergraph-Product Codes. PRX Quantum 4. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸
Hocquenghem, A. (1959). Codes correcteurs d'erreurs. Chiffers 2, 147–156. ↩¹
Huangfu, Q. and Hall, J. J. (2018). Parallelizing the dual revised simplex method. Mathematical Programming Computation 10, 119–142. ↩¹ ↩²
Huffman, W. C. and Pless, V. (2010). Fundamentals of error-correcting codes (Cambridge university press). ↩¹ ↩² ↩³
Jacob, A.; McLauchlan, C. and Browne, D. E. (2025). Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes, arXiv:2508.08191 [quant-ph]. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹
Kapshikar, U. and Kundu, S. (2023). On the hardness of the minimum distance problem of quantum codes. IEEE Transactions on Information Theory 69, 6293–6302. ↩¹ ↩²
Kitaev, A. (2003). Fault-tolerant quantum computation by anyons. Annals of Physics 303, 2–30. ↩¹ ↩² ↩³
Knill, E. and Laflamme, R. (1996). Concatenated quantum codes, arXiv preprint quant-ph/9608012. ↩¹ ↩²
Koenig, R. and Smolin, J. A. (2014). How to efficiently select an arbitrary Clifford group element. Journal of Mathematical Physics 55, 122202. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶
Koukoulekidis, N.; IV, F. Š.; Leib, M. and Pereira, F. R. (2024). Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes, arXiv:2401.07583 [quant-ph]. ↩¹ ↩² ↩³ ↩⁴ ↩⁵
Krastanov, S.; de la Cerda, A. S. and Narang, P. (2020). Heterogeneous Multipartite Entanglement Purification for Size-Constrained Quantum Devices, arXiv preprint arXiv:2011.11640. ↩¹
Lacroix, N.; Bourassa, A.; Heras, F. J.; Zhang, L. M.; Bausch, J.; Senior, A. W.; Edlich, T.; Shutty, N.; Sivak, V.; Bengtsson, A. and others (2024). Scaling and logic in the color code on a superconducting quantum processor, arXiv preprint arXiv:2412.14256. ↩¹
Lafiamme, R.; Miquel, C.; Paz, J. P. and Zurek, W. H. (1996). Perfect quantum error correction code. Physical Review Letters 77, 198–201. ↩¹
Landahl, A. J.; Anderson, J. T. and Rice, P. R. (2011). Fault-tolerant quantum computing with color codes, arXiv:1108.5738 [quant-ph]. ↩¹ ↩² ↩³ ↩⁴ ↩⁵
Leverrier, A.; Tillich, J.-P. and Zémor, G. (2015). Quantum expander codes. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (IEEE); pp. 810–824. ↩¹
Li, Y.; Chen, X. and Fisher, M. P. (2019). Measurement-driven entanglement transition in hybrid quantum circuits. Physical Review B 100, 134306. ↩¹ ↩² ↩³ ↩⁴
Liang, Z.; Liu, K.; Song, H. and Chen, Y.-A. (2025). Generalized toric codes on twisted tori for quantum error correction, arXiv:2503.03827 [quant-ph]. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹² ↩¹³ ↩¹⁴ ↩¹⁵ ↩¹⁶
Liang, Z.; Xu, Y.; Iosue, J. T. and Chen, Y.-A. (2024). Extracting Topological Orders of Generalized Pauli Stabilizer Codes in Two Dimensions. PRX Quantum 5. ↩¹
Lin, H.-K.; Lim, P. K.; Kovalev, A. A. and Pryadko, L. P. (2025). Abelian multi-cycle codes for single-shot error correction, arXiv:2506.16910 [quant-ph]. ↩¹ ↩²
Lin, H.-K. and Pryadko, L. P. (2024). Quantum two-block group algebra codes. Physical Review A 109, 022407. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹²
Lin, S. and Costello, D. (2024). Error Control Coding (Pearson). ↩¹
van Lint, J. H.; van der Geer, G.; van Lint, J. H. and van der Geer, G. (1988). Classical Goppa codes. Introduction to Coding Theory and Algebraic Geometry, 22–24. ↩¹
Lubin, M.; Dowson, O.; Garcia, J. D.; Huchette, J.; Legat, B. and Vielma, J. P. (2023). JuMP 1.0: Recent improvements to a modeling language for mathematical optimization. Mathematical Programming Computation 15, 581–589. ↩¹
MacKay, D. J.; Mitchison, G. and McFadden, P. L. (2004). Sparse-graph codes for quantum error correction. IEEE Transactions on Information Theory 50, 2315–2330. ↩¹
Makhorin, A. (2008). GLPK (GNU linear programming kit), http://www. gnu. org/s/glpk/glpk. html. ↩¹ ↩²
McEliece, R. J. (1978). A public-key cryptosystem based on algebraic. Coding Thv 4244, 114–116. ↩¹
Mian, F. A.; Gwilliam, O. and Krastanov, S. (2026). Multivariate Multicycle Codes for Complete Single-Shot Decoding, arXiv:2601.18879 [quant-ph]. ↩¹ ↩²
Muller, D. E. (1954). Application of Boolean algebra to switching circuit design and to error detection. Transactions of the IRE professional group on electronic computers, 6–12. ↩¹ ↩²
Naghipour, A.; Jafarizadeh, M. A. and Shahmorad, S. (2015). Quantum stabilizer codes from Abelian and non-Abelian groups association schemes. International Journal of Quantum Information 13, 1550021. ↩¹
Nahum, A.; Ruhman, J.; Vijay, S. and Haah, J. (2017). Quantum Entanglement Growth under Random Unitary Dynamics. Physical Review X 7, 031016. ↩¹ ↩² ↩³
Panteleev, P. and Kalachev, G. (2021). Degenerate Quantum LDPC Codes With Good Finite Length Performance. Quantum 5, 585, arXiv:1904.02703 [quant-ph]. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹
Panteleev, P. and Kalachev, G. (Jun 2022). Asymptotically Good Quantum and Locally Testable Classical LDPC Codes. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (ACM, Rome Italy); pp. 375–388. ↩¹ ↩² ↩³ ↩⁴ ↩⁵
Patterson, N. (1975). The algebraic decoding of Goppa codes. IEEE Transactions on Information Theory 21, 203–207. ↩¹
Pecorari, L.; Jandura, S.; Brennen, G. K. and Pupillo, G. (2025). High-rate quantum LDPC codes for long-range-connected neutral atom registers. Nature Communications 16, 1111. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷
Postema, J. J. and Kokkelmans, S. J. (2025). Existence and Characterisation of Bivariate Bicycle Codes, arXiv:2502.17052 [quant-ph]. ↩¹
Pryadko, L. P. and Kovalev, A. A. (2013). Quantum``hyperbicycle''low-stabilizer-weight finite-rate error correction codes. Bulletin of the American Physical Society 58. ↩¹ ↩²
Pryadko, L. P.; Shabashov, V. A. and Kozin, V. K. (2023). QDistRnd: A GAP package for computing the distance of quantum error-correcting codes, arXiv preprint arXiv:2308.15140. ↩¹
Quintavalle, A. O.; Vasmer, M.; Roffe, J. and Campbell, E. T. (2021). Single-shot error correction of three-dimensional homological product codes. PRX Quantum 2, 020340. ↩¹
Quintavalle, A. O.; Vasmer, M.; Roffe, J. and Campbell, E. T. (2021). Single-Shot Error Correction of Three-Dimensional Homological Product Codes. PRX Quantum 2. ↩¹ ↩²
Raaphorst, S. (2003). Reed-muller codes. Carleton University, May 9. ↩¹ ↩²
Raveendran, N.; Rengaswamy, N.; Rozpędek, F.; Raina, A.; Jiang, L. and Vasić, B. (2022). Finite Rate QLDPC-GKP Coding Scheme That Surpasses the CSS Hamming Bound. Quantum 6, 767. ↩¹
Reed, I. S. (1954). A class of multiple-error-correcting codes and the decoding scheme. IEEE Transactions on Information Theory 4, 38–49. ↩¹ ↩²
Roffe, J.; Cohen, L. Z.; Quintavalle, A. O.; Chandra, D. and Campbell, E. T. (2023). Bias-Tailored Quantum LDPC Codes. Quantum 7, 1005. ↩¹
Sabo, E. (2022). Trellis Decoding And Applications For Quantum Error Correction. Ph.D. Thesis, Georgia Tech. ↩¹ ↩² ↩³
Shor, P. W. (1995). Scheme for reducing decoherence in quantum computer memory. Physical review A 52, R2493. ↩¹
Singh, H. (2019). Code based cryptography: Classic mceliece, arXiv preprint arXiv:1907.12754. ↩¹
Steane, A. M. (1996). Error correcting codes in quantum theory. Physical Review Letters 77, 793. ↩¹
Steane, A. M. (1999). Quantum reed-muller codes. IEEE Transactions on Information Theory 45, 1701–1703. ↩¹ ↩²
Steane, A. M. (2007). A tutorial on quantum error correction. In: PROCEEDINGS-INTERNATIONAL SCHOOL OF PHYSICS ENRICO FERMI, Vol. 162 (IOS Press; Ohmsha; 1999); p. 1. ↩¹
Sugiyama, Y.; Kasahara, M.; Hirasawa, S. and Namekawa, T. (1975). A method for solving key equation for decoding Goppa codes. Information and Control 27, 87–99. ↩¹
Terhal, B. M. (2015). Quantum error correction for quantum memories. Rev. Mod. Phys. 87, 307–346. ↩¹
Tillich, J.-P. and Zémor, G. (2006). On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation. In: 2006 IEEE International Symposium on Information Theory (IEEE); pp. 1549–1553. ↩¹ ↩²
Tillich, J.-P. and Zémor, G. (2013). Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength. IEEE Transactions on Information Theory 60, 1193–1202. ↩¹ ↩² ↩³
Van Den Berg, E. (2021). A simple method for sampling random Clifford operators. In: 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE); pp. 54–59. ↩¹
Vardy, A. (1997). The intractability of computing the minimum distance of a code. IEEE Transactions on Information Theory 43, 1757–1766. ↩¹ ↩²
Voss, L.; Xian, S. J.; Haug, T. and Bharti, K. (2024). Multivariate Bicycle Codes, arXiv:2406.19151 [quant-ph]. ↩¹ ↩² ↩³ ↩⁴
Wang, M. and Mueller, F. (2024). Coprime Bivariate Bicycle Codes and their Properties, arXiv preprint arXiv:2408.10001. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷
Wang, R.; Lin, H.-K. and Pryadko, L. P. (2023). Abelian and non-Abelian quantum two-block codes. In: 2023 12th International Symposium on Topics in Coding (ISTC) (IEEE); pp. 1–5. ↩¹
Wang, R. and Pryadko, L. P. (2022). Distance bounds for generalized bicycle codes, arXiv:2203.17216 [quant-ph]. ↩¹
White, G. and Grassl, M. (2006). A new minimum weight algorithm for additive codes. In: 2006 IEEE International Symposium on Information Theory (IEEE); pp. 1119–1123. ↩¹ ↩²
Wilde, M. M. (2009). Logical operators of quantum codes. Physical Review A 79, 062322. ↩¹
Wirtz, M. (1988). On the parameters of Goppa codes. IEEE transactions on information theory 34, 1341–1343. ↩¹
Xu, Q.; Zhou, H.; Zheng, G.; Bluvstein, D.; Ataides, J. P.; Lukin, M. D. and Jiang, L. (2024). Fast and Parallelizable Logical Computation with Homological Product Codes, arXiv:2407.18490 [quant-ph]. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸
Yu, S.; Bierbrauer, J.; Dong, Y.; Chen, Q. and Oh, C. H. (2013). All the Stabilizer Codes of Distance 3. IEEE Transactions on Information Theory 59, 5179–5185. ↩¹ ↩²
Zeng, W. and Pryadko, L. P. (2019). Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates. Physical Review Letters 122. ↩¹ ↩² ↩³ ↩⁴

Suggested reading

References