Large-Language-Model Discovery of Quantum LDPC Codes through Structured Concept Evolution
quant-ph, cs.AI
Submitted: 2026-06-23
Updated: 2026-11-04
Comments: 23 pages, 4 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: Quantum low-density parity-check codes promise low-overhead error correction, but high-performing constructions remain hard to find.
Terminology
Abstract
Quantum low-density parity-check codes promise low-overhead error correction, but high-performing constructions remain hard to find. Here we introduce structured concept evolution, in which a large language model (LLM) evolves construction programs and their internal search strategies by modifying the finite group, protograph shapes or entry-assignment rule. We search for codes with fewer than 600 data qubits and check weight at most 12, optimizing kd 2/n or the circuit-level logical error rate. Our method improves on published lifted-product benchmarks in selected parameter regimes, with exactly certified distances for the leading results. Circuit-level optimization typically yields lower logical error rates than kd 2/n optimization, often despite smaller code distances. With the same evolution framework and step budget, the best LLM outperforms all random-mutation and hill-climbing runs on both objectives. Our results point to LLM-driven program search as an approach to designing general quantum LDPC codes.
Sources
- A Quantum Approximate Optimization Algorithm
- Quantum codes on a lattice with boundary
- Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
- Scaling the Automated Discovery of Quantum Circuits via Reinforcement Learning with Gadgets
- Discovering highly efficient low-weight quantum error-correcting codes with reinforcement learning
- Agentic Exploration of Physics Models
- Meta-Designing Quantum Experiments with Language Models
- Co-Designing Quantum Codes with Transversal Diagonal Gates via Multi-Agent Systems
- Evolution through Large Models
- AlphaEvolve: A coding agent for scientific and algorithmic discovery
- Illuminating search spaces by mapping elites
- On the iterative decoding of sparse quantum codes
- Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements