Metraipolis › archive › dc_800882ffd55d
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes — arXiv:2611.06819
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06819
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:22:45.654Z
- SHA-256 of the archived text
2f4117961c4f61fe56e3a0b328e1b1427fcd499f5408729d50a1b5ff87f11a21- Stable URL of this page
https://metraipolis.com/documento/dc_800882ffd55d
How to cite
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes — arXiv:2611.06819 — arXiv (en), https://arxiv.org/abs/2611.06819 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_800882ffd55d (Metraipolis archive dc_800882ffd55d, sha256 2f4117961c4f61fe56e3a0b328e1b1427fcd499f5408729d50a1b5ff87f11a21)
BibTeX
@misc{dc800882ffd55d,
title = {GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes — arXiv:2611.06819},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06819},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_800882ffd55d; sha256 2f4117961c4f61fe56e3a0b328e1b1427fcd499f5408729d50a1b5ff87f11a21},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06819. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Choosing a quantum error-correcting code for a real device means scoring candidates with circuit-level simulations so slow that only a few hundred can be run. So every evaluation counts, and a search is judged by how many good codes it finds per paid evaluation. Quantum LDPC codes built from a few group elements protect many logical qubits, but good ones are rare in a huge space. We introduce GFlowQEC, to our knowledge the first generative flow network (GFlowNet) for quantum code design. It builds a code one group element at a time and learns to propose codes in proportion to a power of their score. We train it once on scores from earlier searches, freeze it, and let it propose lifted-product codes with 180 physical qubits, scored by their distances. Ranking ten of its draws per paid call, it finds more than twice as many new top-scoring codes (inequivalent to any it was trained on) as tuned parallel tempering, even when tempering starts from GFlowQEC's training codes. It finds more than three and a half times as many as a supervised screen ranking ten random candidates per call. When both rank a hundred, the screen beats GFlowQEC, and does best ranking GFlowQEC's draws. Soft Q-learning, which shares the GFlowNet's optimal policy, does as well at one noise bias and better at the other, so the gain does not depend on the GFlowNet's training loss. Trained proposers can make a budget of expensive evaluations go further when good codes are rare. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2611.06819 — 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-05T18:15:49.043Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).