Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search
Summary
An LLM-guided evolutionary workflow has been developed for discovering quantum LDPC codes, specifically bivariate-bicycle and perturbed bivariate-bicycle code ansätze. This system mutates Python programs using language models to generate candidate codes. Across five campaigns, the workflow executed approximately 1,650 evolutionary iterations, screening about 2 x 10^5 candidate codes. This process required around 140 hours of computation and approximately US\$400 in LLM inference costs. Candidate codes undergo a staged validation pipeline involving GF(2) rank computation, distance estimation, mixed-integer linear programming, and equivalence checks. At block length n ≤ 360, the system identified 465 distinct candidate codes: 97 CSS bivariate-bicycle codes and 368 non-CSS perturbed variants. The CSS search recovered known high-performing codes and found 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 produced perturbed codes matching the gross-code figure of merit at [[144,12,12]].
Key takeaway
For AI Scientists and Research Scientists exploring quantum error correction, this LLM-guided approach offers a viable path for discovering new quantum LDPC codes. You should consider integrating language models to mutate code-generating programs within an evolutionary search framework. This method can efficiently explore vast design spaces, potentially yielding high-performing codes like the indecomposable [[288,16,12]] code, while managing computational costs. Implement a robust, staged validation pipeline to reliably certify any discovered code parameters.
Key insights
LLM-guided program evolution offers a practical method for structured quantum code discovery when combined with independent evaluation.
Principles
- Quantum code discovery benefits from LLM-guided mutation.
- Staged validation is crucial for certifying code parameters.
- Evolutionary search explores large algebraic design spaces.
Method
The workflow mutates Python programs generating code ansätze, evaluates candidates via GF(2) rank, distance estimation, MILP, and deduplication, then certifies parameters.
In practice
- Apply LLMs to mutate code-generating programs.
- Implement a multi-stage validation pipeline.
- Search for indecomposable codes at specific block lengths.
Topics
- Quantum LDPC Codes
- LLM-guided Search
- Evolutionary Algorithms
- Quantum Error Correction
- Bivariate Bicycle Codes
- Code Discovery
Best for: AI Scientist, Research Scientist
Related on AIssential
Editorial summary, takeaway, and curation by AIssential. Original article published by Artificial Intelligence.