Source note2 min read
Large-Language-Model Discovery of Quantum LDPC Codes through Structured Concept Evolution
Source
arXiv
arxiv.org/abs/2606.24808v1
Source
- Source name: arXiv
- Source kind: paper
- Authors / organization: Zidu Liu, Florian Marquardt
- Venue: arXiv: quant-ph
- Published: 2026-06-23
- Collected: 2026-06-24
- URL: http://arxiv.org/abs/2606.24808v1
- PDF: https://arxiv.org/pdf/2606.24808v1
- DOI: UNKNOWN
Plain-Language Brief
Researchers have developed a new method called Structured Concept Evolution (SCE) that uses a large language model and structured algebraic mutation grammar to discover Quantum Low-Density Parity-Check (qLDPC) codes, which are promising for error correction in quantum computing. SCE evolves structured concepts consisting of algebraic specifications and executable programs that realize them, allowing the discovery of a diverse set of competitive code families, including those beyond standard designs like bivariate-bicycle codes.
What the Document Says
- The researchers introduce Structured Concept Evolution (SCE), a search framework that pairs a large language model with a structured algebraic mutation grammar to discover lifted-product code families, a class of CSS qLDPC codes.
- Instead of asking the LLM to design codes from first principles, SCE evolves structured concepts consisting of algebraic specifications paired with executable programs that realize them.
- SCE uses hierarchical mutations that modify the group algebra, protograph geometry, or base space.
- Running SCE, they discover a diverse set of competitive code families, ranging from abelian constructions to families over non-abelian groups beyond those underlying standard designs such as bivariate-bicycle codes.
- The results are characterized under code-capacity depolarizing noise with BP+OSD decoding.
- These results are obtained with lightweight models (GPT-5.4-mini and GPT-5.4-nano).
Key Concepts Mentioned
- Quantum computers
- Quantum Low-Density Parity-Check codes (qLDPC)
- Structured Concept Evolution (SCE)
- Lifted-product code families
- CSS qLDPC codes
- Algebraic specifications
- Executable programs
- Group algebra
- Protograph geometry
- Base space
- Depolarizing noise
- BP+OSD decoding
- GPT-5.4-mini
- GPT-5.4-nano
Claims Made by the Document
- SCE is a successful method for discovering competitive qLDPC code families.
Evidence Used
- The diverse set of discovered code families and their characterization under depolarizing noise with BP+OSD decoding.
Methods / Approach
UNKNOWN
Limitations Stated by the Authors
UNKNOWN
Limitations Noted by the Agent
Agent interpretation — not from the source.
UNKNOWN
Open Questions
UNKNOWN
Notes for Future Q&A
May include interpretation. Labeled where it does.
UNKNOWN
Raw Abstract / Excerpt
Quantum computers could outperform classical machines on important problems, but only if the errors that pervade quantum hardware can be corrected at scale. Quantum low-density parity-check (qLDPC) codes offer a promising route to this goal by combining sparse parity checks with finite encoding rate and growing distance, but their construction remains a challenging discrete design problem. Here we introduce structured concept evolution (SCE), a search framework that pairs a large language model with a structured algebraic mutation grammar to discover lifted-product code families, a class of CSS qLDPC codes. Instead of asking the LLM to design codes from first principles, SCE evolves structured concepts consisting of algebraic specifications paired with executable programs that realize them, using hierarchical mutations that modify the group algebra, protograph geometry, or base space. Running SCE, we discover a diverse set of competitive code families, ranging from abelian constructions to families over non-abelian groups beyond those underlying standard designs such as bivariate-bicycle codes, and characterize them under code-capacity depolarizing noise with BP+OSD decoding. These results are obtained with lightweight models (GPT-5.4-mini and GPT-5.4-nano).
