← back to the board

References

Every paper and tool the challenge cites. Submissions reference an entry by its arXiv id or DOI; verified codes that cite each one are listed beneath it. The machine-readable source is refs.bib.

albert2026zoo
Albert, Victor V. and Faist, Philippe. Handbook of Error-Correcting Codes. 2026. arXiv:2606.11484
aydin2026breaking
Aydin, Arda and Tamo, Itzhak and Barg, Alexander. Breaking the bicycle frame: Coset-based quantum LDPC codes. 2026. arXiv:2606.17268
bhardwaj2026mitten
Bhardwaj, Aditya and Ma, Muzhou and Meister, Nadine and King, Robbie and Bluvstein, Dolev and Preskill, John and Cain, Madelyn and Xu, Qian and Huang, Hsin-Yuan. High-rate qLDPC processors. 2026. arXiv:2607.28795
bravyi2010tradeoffs
Bravyi, Sergey and Poulin, David and Terhal, Barbara. Tradeoffs for reliable quantum information storage in 2D systems. Physical Review Letters 104(5):050503. 2010. arXiv:0909.5200 · doi
bravyi2024high
Bravyi, Sergey and Cross, Andrew W. and Gambetta, Jay M. and Maslov, Dmitri and Rall, Patrick and Yoder, Theodore J. High-threshold and low-overhead fault-tolerant quantum memory. Nature 627:778-782. 2024. arXiv:2308.07915 · doi
breuckmann2021quantum
Breuckmann, Nikolas P. and Eberhardt, Jens Niklas. Quantum Low-Density Parity-Check Codes. PRX Quantum 2(4):040101. 2021. arXiv:2103.06309 · doi
calderbank1996good
Calderbank, A. Robert and Shor, Peter W. Good quantum error-correcting codes exist. Physical Review A 54(2):1098-1105. 1996. arXiv:quant-ph/9512032 · doi
cruzbenito2026evolutionary
Cruz-Benito, Juan and Cross, Andrew W. and Kremer, David and Faro, Ismael. Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search. 2026. arXiv:2606.02418
gottesman1997stabilizer
Gottesman, Daniel. Stabilizer Codes and Quantum Error Correction. 1997. arXiv:quant-ph/9705052
grassl2007codetables
Grassl, Markus. Bounds on the minimum distance of linear codes and quantum codes. 2007.
gu2026nearest
Gu, Boren and Noszko, Tamas and Steffan, Vincent and Eberhardt, Jens Niklas and Roffe, Joschka and Eisert, Jens and Koutsioumpas, Stergios. Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid. 2026. arXiv:2606.19482
cited by 1[[294,12,14]]
he2025reinforcement
He, Austin Yubo and Liu, Zi-Wen. Discovering highly efficient low-weight quantum error-correcting codes with reinforcement learning. 2025. arXiv:2502.14372
hong2026zszlp
kapshikar2023hardness
Kapshikar, Upendra and Kundu, Srijita. On the Hardness of the Minimum Distance Problem of Quantum Codes. IEEE Transactions on Information Theory 69(10). 2023. arXiv:2203.04262 · doi
kasai2026orthogonality
Kasai, Kenta. Breaking the Orthogonality Barrier in Quantum LDPC Codes. 2026. arXiv:2601.08824
cited by 1[[684,8,85]]
kitaev2003fault
Kitaev, A. Yu. Fault-tolerant quantum computation by anyons. Annals of Physics 303(1):2-30. 2003. arXiv:quant-ph/9707021 · doi
liang2025planar
liang2025selfdual
Liang, Zijian and Chen, Yu-An. Self-dual bivariate bicycle codes with transversal Clifford gates. 2025. arXiv:2510.05211
liang2025twisted
lin2023twoblock
Lin, Hsiang-Ku and Pryadko, Leonid P. Quantum two-block group algebra codes. 2023. arXiv:2306.16400
lin2024quantum
liu2026concept
Liu, Zidu and Marquardt, Florian. Large-Language-Model Discovery of Quantum LDPC Codes through Structured Concept Evolution. 2026. arXiv:2606.24808
cited by 1[[336,20,20]]
nixon2026vine
Nixon, Georgia M. and McLauchlan, Campbell K. and van Rest, Charles C. L. Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid. 2026. arXiv:2606.20263
okada2026highgirth
Okada, Koki and Kasai, Kenta. High-Girth Regular Quantum LDPC Codes from Affine-Coset Structures. 2026. arXiv:2604.20838
cited by 1[[684,8,85]]
panteleev2021degenerate
Panteleev, Pavel and Kalachev, Gleb. Degenerate quantum LDPC codes with good finite length performance. Quantum 5:585. 2021. arXiv:1904.02703 · doi
panteleev2022asymptotically
Panteleev, Pavel and Kalachev, Gleb. Asymptotically good quantum and locally testable classical LDPC codes. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 375-388. 2022. arXiv:2111.03654 · doi
perlin2023qldpc
Perlin, Michael A. qLDPC. 2023. github.com
pryadko2023qdistrnd
Pryadko, Leonid P. and Shabashov, Vadim A. and Kozin, Valerii K. QDistRnd: A GAP package for computing the distance of quantum error-correcting codes. Journal of Open Source Software 7(71):4120. 2022. doi
roffe2020decoding
Roffe, Joschka and White, David R. and Burton, Simon and Campbell, Earl. Decoding across the quantum low-density parity-check code landscape. Physical Review Research 2(4):043423. 2020. arXiv:2005.07016 · doi
shor1995scheme
Shor, Peter W. Scheme for reducing decoherence in quantum computer memory. Physical Review A 52(4):R2493-R2496. 1995. doi
steane1996error
Steane, Andrew M. Error correcting codes in quantum theory. Physical Review Letters 77(5):793-797. 1996. arXiv:quant-ph/9601029 · doi
steffan2025tile
Steffan, Vincent and Choe, Shin Ho and Breuckmann, Nikolas P. and Pereira, Francisco Revson Fernandes and Eberhardt, Jens Niklas. Tile Codes: High-Efficiency Quantum Codes on a Lattice with Boundary. 2025. arXiv:2504.09171
cited by 1[[294,12,14]]
tillich2014quantum
Tillich, Jean-Pierre and Zemor, Gilles. Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength. IEEE Transactions on Information Theory 60(2):1193-1202. 2014. arXiv:0903.0566 · doi
wang2022distance
Wang, Renren and Pryadko, Leonid P. Distance bounds for generalized bicycle codes. Symmetry 14(7):1348. 2022. arXiv:2203.17216 · doi
yan2026omniqec
Yan, Ge and Li, Shanchuan and Ma, Pengyue and Zhang, Qixin and Ma, Pingchuan and Wang, Jianping and Hsieh, Min-Hsiu and Du, Yuxuan. OmniQEC: Discovering Practical Quantum Error-Correcting Codes by an AI Scientist. 2026. arXiv:2607.25865