GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes
Abstract
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.
Related
- Quantum Evolution Networks Learn Long-Time Coherent Dynamics in Driven Spin Registers
- Quality-of-Transmission Estimation in Quantum Networks: Compute, Simulate, or Learn?
- Neural networks learn to reconstruct multipartite entanglement from quantum marginals
- Generative Replay Mitigates Sample Starvation in Quantum Architecture Search
- Sample Complexity for Generative Learning of Quantum Measurement Data
BibTeX
@misc{batista2026gflowqec,
title = {{GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes}},
author = {Nuno Batista and Gabriel Falcao and Penousal Machado},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.06819},
eprint = {2611.06819},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.06819},
}
RIS
TY - UNPB
TI - GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes
AU - Nuno Batista
AU - Gabriel Falcao
AU - Penousal Machado
PY - 2026
DA - 2026/11/04
PB - arXiv
DO - 10.48550/arxiv.2611.06819
UR - https://arxiv.org/abs/2611.06819
AB - 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.
ER -