Multi-agent discovery of practical quantum LDPC codes

• URL: http://arxiv.org/abs/2608.08996v1
• Date: Mon, 10 Aug 2026 01:32:34 GMT
• Title: Multi-agent discovery of practical quantum LDPC codes
• Abstract summary: Quantum low-density parity-check (qLDPC) codes can encode multiple logical qubits using sparse parity checks.<n>Motivated by recent advances in artificial-intelligence agents for scientific discovery, we develop a multi-agent framework for discovering practical qLDPC codes.
• Score: 2.763808510474517
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum low-density parity-check (qLDPC) codes can encode multiple logical qubits using sparse parity checks, yet searching for useful finite-length instances remains a challenging design problem because code performance must be optimized while satisfying practical constraints. Motivated by recent advances in artificial-intelligence agents for scientific discovery, we develop a multi-agent framework for discovering practical qLDPC codes. The framework combines specialist proposal and review, persistent scientific memory, long-horizon evolution of executable programs, and deterministic construction and evaluation within a closed-loop search. These programs instantiate coset-orbit balanced-product codes, providing a search space that includes bicycle and lifted-product constructions as well as non-normal subgroup actions. To incorporate practical constraints, we restrict the search to binary CSS codes with block length $n\leq400$ and overall weight $w\leq10$. Within this regime, the framework discovers codes with leading or competitive rate--distance performance in every weight class considered, with representative instances including $[[288,16,18]]$ at $w=7$, $[[288,18,18]]$ at $w=9$, and $[[234,28,18]]$ at $w=10$. The search also uncovers structurally distinct, high-performing constructions, including a $[[336,12,\leq24]]$ candidate and a $[[368,18,16]]$ code, both of which are genuine balanced-product constructions with non-normal subgroup actions. When evaluated under code-capacity depolarizing noise using a common BP-OSD decoding protocol, the discovered codes also exhibit low logical failure rates. Together, these results provide hardware-relevant finite-length candidates for further experimental evaluation and show how structured agentic search can contribute to scientific discovery.

Related papers

• ECHO: Early-layer Collaborative Hierarchical Orchestration with Bonus Logits in Speculative Decoding [60.34475274870224]
  ECHO is a hierarchical dual-loop framework that exploits the functional asymmetry between LLM layers.<n>Within the inner loop, early-layer bonus logits drive rapid, multi-step draft-tree exploration at a minimal cost.<n>ECHO significantly boosts mean accepted tokens and achieves a 2.4$times$ to 2.9$times$ speedup.
  arXiv  Detail & Related papers  (2026-09-15T14:21:33Z)
• High-rate qLDPC processors [2.9793870820216486]
  We introduce a family of qLDPC processor codes of encoding rate $20%$ and check weight $9$, based on non-abelian groups.<n>Our decoder is compatible with sub-millisecond average latency per logical cycle, sufficient for real-time decoding on neutral atom hardware.
  arXiv  Detail & Related papers  (2026-07-30T19:43:04Z)
• Logical computation with canonical lifted product codes [3.653555716265332]
  Code-agnostic techniques such as code surgery and gate teleportation apply broadly, but are difficult to make modular, low-overhead, and fully certifiable on complex high-rate codes.<n>Here we overcome these obstacles by co-designing the code together with its logical instruction set for a broad family of emphcanonical lifted-product (LP) codes.<n>We show that these codes admit a emphcanonical logical basis, in which conjugate logical operators are organized into rows and columns of cyclic orbits inherited directly from the underlying classical codes.
  arXiv  Detail & Related papers  (2026-07-30T17:55:34Z)
• OmniQEC: discovering practical quantum error-correcting codes by an AI scientist [20.09408539282161]
  We introduce OmniQEC, an efficient AI scientist for discovering Quantum error correction codes.<n>At its core, OmniQEC combines a self-evolving reasoning mechanism with a slow--fast synergistic workflow.<n>The discovered codes show steadily improving logical-error suppression with increasing physical-qubit budgets.
  arXiv  Detail & Related papers  (2026-07-28T15:31:26Z)
• Breaking the bicycle frame: Coset-based quantum LDPC codes [65.96089068176079]
  Generalizing the construction of two-block group algebra (2BGA) codes, we introduce a family of two-block quantum LDPC codes.<n>We identify several new quantum LDPC codes, including weight-6 codes with parameters $[48,8,6]]$, $[96,8,10]]$, and $[224,12,16]]$.<n>Our codes, when decoded using BP-OSD, perform competitively with BB codes, achieving thresholds of $approx0.65%$ for the weight-6 family and $approx0.35%$ for the weight-8 family.
  arXiv  Detail & Related papers  (2026-06-15T20:20:57Z)
• Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search [1.1038052779321077]
  Quantum LDPC code discovery requires searching large algebraic design spaces while reliably certifying the parameters and equivalence classes of any candidates found.<n>We introduce an LLM-guided evolutionary workflow in which language models mutate Python programs.<n>Across five campaigns, the system performed approximately 1,650 evolutionary iterations, screened about $2 times 105$ candidate codes, and required $sim140$ hours of computation and $sim$US$400 in LLM inference cost.
  arXiv  Detail & Related papers  (2026-06-01T15:58:52Z)
• Qudit Twisted-Torus Codes in the Bivariate Bicycle Framework [0.0]
  We study finite-length qudit quantum low-density parity-check (LDPC) codes from translation-invariant CSS constructions on two-dimensional tori with twisted boundary conditions.<n>For the finite sizes explored, twisted-torus qudit constructions typically achieve larger distances than their untwisted counterparts.
  arXiv  Detail & Related papers  (2026-02-04T11:15:51Z)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [39.98920557126034]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• Don't Get Lost in the Trees: Streamlining LLM Reasoning by Overcoming Tree Search Exploration Pitfalls [83.89771461061903]
  Recent advancements in tree search algorithms guided by verifiers have significantly enhanced the reasoning capabilities of large language models (LLMs)<n>Recent advancements in tree search algorithms guided by verifiers have significantly enhanced the reasoning capabilities of large language models (LLMs)<n>We identify two key challenges contributing to this inefficiency: $textitover-exploration$ due to redundant states with semantically equivalent content, and $textitunder-exploration$ caused by high variance in verifier scoring.<n>We propose FETCH, a flexible, plug-and-play system compatible with various tree search algorithms.
  arXiv  Detail & Related papers  (2025-02-16T16:12:01Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.