Large-Language-Model Discovery of Quantum LDPC Codes through Structured Concept Evolution

arXiv:2606.24808 · quant-ph, cs.AI · Submitted 2026-06-23 · Read on arXiv

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

Related papers