Metraipolis › archive › dc_35d4a85ff937

Large Language Model-Guided Discovery of Weight-Five Bivariate Bicycle Codes — arXiv:2610.06623

Source
arXiv
Original
https://arxiv.org/abs/2610.06623
License (as archived)
CC0-1.0
Archived
2026-10-06T05:27:48.385Z
SHA-256 of the archived text
774b6155bc3564b049d9ce765823a11392a1736ae9a08c1ba2c2ada0292bfd2a
Stable URL of this page
https://metraipolis.com/documento/dc_35d4a85ff937

How to cite

Large Language Model-Guided Discovery of Weight-Five Bivariate Bicycle Codes — arXiv:2610.06623 — arXiv, https://arxiv.org/abs/2610.06623 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_35d4a85ff937 (Metraipolis archive dc_35d4a85ff937, sha256 774b6155bc3564b049d9ce765823a11392a1736ae9a08c1ba2c2ada0292bfd2a)
BibTeX
@misc{dc35d4a85ff937,
  title = {Large Language Model-Guided Discovery of Weight-Five Bivariate Bicycle Codes — arXiv:2610.06623},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.06623},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_35d4a85ff937; sha256 774b6155bc3564b049d9ce765823a11392a1736ae9a08c1ba2c2ada0292bfd2a},
  year = {2026}
}

Archived text

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

Building on our earlier program-evolution workflow guided by large language models (LLMs), we study weight-five bivariate bicycle (BB) and perturbed bivariate bicycle (PBB) codes. The resulting catalogue contains 1,142 distinct code proposals, including 1,081 nonbaseline proposals attributable to LLM-generated programs. Across the catalogue, we certify connected Calderbank--Shor--Steane (CSS) realizations [[96,4,10]], [[140,6,10]], and [[180,4,14]]. A post-search comparison certifies seven imported Lin--Pryadko archive constructions. For leading parameter triples also represented in that archive, we provide exact distance evidence, explicit bivariate presentations, and verified component reductions. A basis-independent connectivity analysis identifies 409 of the 1,142 catalogue entries as disconnected and shows that 73.1\% of the classes with exact distance certificates contain repeated connected components. Algebraic analysis organizes the connected CSS classes into order-3, order-7, and order-15 cyclotomic-kernel strata. The strongest exact connected PBB parameter point is [[216,4,10]], attained by two distinct component classes. Among the 936 distinct CSS proposals from the LLM-guided campaign with a recorded positive distance, 816 (87.18\%) are certified at $d\geq5$. For comparison, three random-search controls each sample 6,444 CSS code proposals uniformly without replacement, using the same per-lattice and encoded-dimension sample counts as the LLM-guided campaign. In these controls, 4,672--4,785 proposals (72.50--74.26\%) meet the same criterion. The LLM-guided campaign has the higher certified yield, while the random controls cover more connected classes. Together, these results extend LLM-guided discovery to a more constrained code family and provide a reproducible structural and exact-distance account of its strongest candidates.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2610.06623 — 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-10-06T05:24:06.179Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).