Metraipolis › archive › dc_f952bdef023b

Hardware-Efficient Reinforcement-Learned Scheduling for Quantum LDPC Decoders — arXiv:2611.04179

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04179
License (as archived)
CC0-1.0
Archived
2026-11-04T12:49:12.390Z
SHA-256 of the archived text
4b6ad1399217e092ebcc98d621a834d07e851e31aeee9021d48562cfdf8bbe07
Stable URL of this page
https://metraipolis.com/documento/dc_f952bdef023b

How to cite

Hardware-Efficient Reinforcement-Learned Scheduling for Quantum LDPC Decoders — arXiv:2611.04179 — arXiv (en), https://arxiv.org/abs/2611.04179 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f952bdef023b (Metraipolis archive dc_f952bdef023b, sha256 4b6ad1399217e092ebcc98d621a834d07e851e31aeee9021d48562cfdf8bbe07)
BibTeX
@misc{dcf952bdef023b,
  title = {Hardware-Efficient Reinforcement-Learned Scheduling for Quantum LDPC Decoders — arXiv:2611.04179},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04179},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f952bdef023b; sha256 4b6ad1399217e092ebcc98d621a834d07e851e31aeee9021d48562cfdf8bbe07},
  year = {2026}
}

Archived text

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

Quantum low-density parity-check (QLDPC) codes are promising for fault-tolerant quantum computing, but their decoding algorithms present significant hardware implementation challenges. Reinforcement-learned sequential belief propagation (RL-S) improves the error-correction performance of conventional belief propagation (BP) through adaptive variable-node scheduling. However, its heap-based priority management introduces substantial hardware overhead. This paper presents hardware implementations of BP, RL-S, and bucket-based reinforcement-learned BP (BRL-S) for the [[288,12,18]] bivariate bicycle QLDPC code. The BRL-S architectures employ quantized priorities and first-in, first-out (FIFO) buckets to simplify scheduling. Three configurations with two, four, and eight priority levels are evaluated. FPGA synthesis results demonstrate that BRL-S reduces lookup-table utilization by approximately 68--72% compared with RL-S. ASIC synthesis further shows reductions of 63--67% in area and 64--69% in estimated power consumption. These results demonstrate that bucket-based scheduling substantially improves the hardware efficiency of reinforcement-learned QLDPC decoders.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.04179 — 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-04T12:32:47.113Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).