Metraipolis › archive › dc_bc0675a82ae3

Researcher-in-the-Loop Evolutionary Discovery of Entanglement-Assisted Quantum Code Families — arXiv:2610.41183

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.41183
License (as archived): CC0-1.0
Archived: 2026-11-03T08:00:48.503Z
SHA-256 of the archived text: 135cf13e84def4089c5acd1122b28bbb4e9f527510631ecd62e4d827678fd758
Stable URL of this page: https://metraipolis.com/documento/dc_bc0675a82ae3

How to cite

Researcher-in-the-Loop Evolutionary Discovery of Entanglement-Assisted Quantum Code Families — arXiv:2610.41183 — arXiv (en), https://arxiv.org/abs/2610.41183 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bc0675a82ae3 (Metraipolis archive dc_bc0675a82ae3, sha256 135cf13e84def4089c5acd1122b28bbb4e9f527510631ecd62e4d827678fd758)

BibTeX

@misc{dcbc0675a82ae3,
  title = {Researcher-in-the-Loop Evolutionary Discovery of Entanglement-Assisted Quantum Code Families — arXiv:2610.41183},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41183},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bc0675a82ae3; sha256 135cf13e84def4089c5acd1122b28bbb4e9f527510631ecd62e4d827678fd758},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41183. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

LLM-guided program evolution can produce mathematical constructions, but validity, generality, and reproducibility require distinct evidence. We develop a researcher-in-the-loop discovery pipeline that combines program evolution, exact evaluation, mathematical generalization, certified nonexistence checks, and formal proof checking. We apply it to entanglement-assisted quantum error-correcting codes (EAQECCs). Starting from tasks that did not specify a family formula, evolved programs produced finite qubit constructions whose structure researchers generalized to the family $[[n,1,n-1;n-q-1]]_q$ for prime powers $q\ge3$ at $n\ge2q+1$ and for $q=2$ at odd $n\ge5$. Lean checks the algebraic certificate underlying this family. Together with entanglement lifting, the family closes 54 gaps in archived EAQECC tables. The released evidence includes 115 verified code records, ten nonexistence results with checked DRAT proofs, family implementations, and preserved search programs for exact checks and seeded replay. In a controlled cohort of eight paired generation blocks, validation-selected iterative programs achieve success in 46.1% and 31.6% of held-out executions at unseen lengths $n=13,15$, compared with 19.5% and 3.1% for independently generated programs. In this setting, program evolution and researcher analysis turn finite computational discoveries into a proved family with independently checkable evidence.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.41183 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T07:59:38.698Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).