Quantum LDPC code discovery requires searching large algebraic design spaces while reliably certifying the parameters and equivalence classes of any candidates found. We introduce an LLM-guided evolutionary workflow in which language models mutate Python programs that generate bivariate-bicycle and perturbed bivariate-bicycle code ansätze. Across five campaigns, the system performed approximately 1{,}650 evolutionary iterations, screened about $2 \times 10^5$ candidate codes, and required ${\sim}140$ hours of computation and ${\sim}$US\$400 in LLM inference cost. Candidate codes are evaluated through a staged validation pipeline combining $\mathrm{GF}(2)$ rank computation, distance estimation and certification, mixed-integer linear programming, BLISS Tanner-graph deduplication, decomposability analysis, and local-Clifford equivalence checks. At block length $n \leq 360$, the workflow identifies 465 distinct candidate codes: 97 CSS bivariate-bicycle codes and 368 non-CSS perturbed variants. The CSS search recovers known high-performing codes and finds new finite-length representatives, including an indecomposable [[288,16,12]] code and higher-weight codes with up to $k = 50$ at distance $d = 8$. The non-CSS search produces perturbed codes matching the gross-code figure of merit at [[144,12,12]], along with additional high-distance candidates reported as certified values or upper bounds according to MILP status. Overall, these results show that LLM-guided program evolution can serve as a practical tool for structured quantum-code discovery when paired with independent evaluation.
Yale University（耶鲁大学）；Yale Quantum Institute, Yale University（耶鲁量子研究所，耶鲁大学）；IBM Quantum, T. J. Watson Research Center（IBM 量子，T.J.沃森研究中心）；School of Physics, University of Sydney（悉尼大学物理学院）；IBM Quantum, IBM Almaden Research Center（IBM 量子，IBM阿尔马登研究中心）；IBM Denmark（IBM丹麦）
University of California, Riverside（加州大学河滨分校）；Google Quantum AI（谷歌量子人工智能）；Department of Physics & Astronomy, University of California, Riverside（加州大学河滨分校物理与天文学系）
Towards self-correcting quantum codes for neutral atom arrays
Department of Physics, University of Colorado, Boulder（科罗拉多大学博尔德分校物理系）；Center for Theory of Quantum Matter, University of Colorado, Boulder（科罗拉多大学博尔德分校量子物质理论中心）；Joint Quantum Institute & Joint Center for Quantum Information and Computer Science, NIST/University of Maryland, College Park（马里兰大学帕克分校与国家标准与技术研究院联合量子研究所及联合量子信息与计算科学中心）；JILA, University of Colorado and National Institute of Standards and Technology, Boulder（科罗拉多大学与国家标准与技术研究院联合JILA实验室）
Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes
Massachusetts Institute of Technology（麻省理工学院）；Department of Physics, Massachusetts Institute of Technology（麻省理工学院物理系）；Department of Mathematics, Massachusetts Institute of Technology（麻省理工学院数学系）；Physics & Informatics Laboratories, NTT Research（NTT研究院物理与信息实验室）
Large-Language-Model Discovery of Quantum LDPC Codes through Structured Concept Evolution
Max Planck Institute for the Science of Light（光科学Max Planck研究所）；Department of Physics, Friedrich-Alexander University Erlangen-Nürnberg（埃尔兰根-纽伦堡弗里德里希-亚历山大大学物理系）
Metachecks in Bivariate Bicycle Codes: Syndrome Distance, Measurement Faults, and Repair Limits
Centre for Quantum Software and Information (QSI), School of Computer Science, University of Technology Sydney（悉尼科技大学计算机科学学院量子软件与信息中心）；School of Electrical Engineering and Telecommunications, University of New South Wales (UNSW)（新南威尔士大学电气与电信学院）
Efficient foundation decoders for fault-tolerant quantum computing
College of Computing and Data Science, Nanyang Technological University, Singapore（南洋理工大学计算与数据科学学院）；Department of Electrical Engineering and Computer Science, Tokyo University of Agriculture and Technology, Koganei, Tokyo, Japan（东京农业与技术大学电气工程与计算机科学系）；School of Artificial Intelligence, Shanghai Jiao Tong University, Shanghai, China（上海交通大学人工智能学院）；Science, Mathematics and Technology Cluster, Singapore University of Technology and Design, Singapore（新加坡科技设计大学科学、数学与技术集群）；School of Physical and Mathematical Science, Nanyang Technological University, Singapore（南洋理工大学物理与数学科学学院）
Demonstration of low-overhead quantum error correction codes
Zhejiang University（浙江大学）；Shanghai Qi Zhi Institute（上海人工智能实验室）；Tsinghua University（清华大学）；Harvard University（哈佛大学）；Xi'an Jiaotong University（西安交通大学）；Institute of Physics, Polish Academy of Sciences（波兰科学院物理研究所）；Hefei National Laboratory（合肥国家实验室）
Multivariate Multicycle Codes for Complete Single-Shot Decoding
Manning College of Information and Computer Sciences, University of Massachusetts Amherst（马萨诸塞大学阿默斯特分校曼宁信息与计算机科学学院）；Department of Mathematics and Statistics, University of Massachusetts Amherst（马萨诸塞大学阿默斯特分校数学与统计系）；Department of Physics, University of Massachusetts Amherst（马萨诸塞大学阿默斯特分校物理系）
Adaptive decoding of quantum LDPC codes through decoder disagreement
Centre for Computational Science, University College London（计算科学中心，伦敦大学学院）；Advanced Research Computing Centre, University College London（高级研究计算中心，伦敦大学学院）
