Metraipolis › archive › dc_ab432cd3bfaf

Learned Parallel Bit-Flipping Sequential Belief Propagation Decoding of Quantum LDPC Codes — arXiv:2610.01068

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.01068
License (as archived)
CC0-1.0
Archived
2026-10-06T17:48:44.933Z
SHA-256 of the archived text
f96d9885044983464b5c63c687b4836646d87e2a4ab70b07094afb9e45eb8e8a
Stable URL of this page
https://metraipolis.com/documento/dc_ab432cd3bfaf

How to cite

Learned Parallel Bit-Flipping Sequential Belief Propagation Decoding of Quantum LDPC Codes — arXiv:2610.01068 — arXiv (en), https://arxiv.org/abs/2610.01068 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ab432cd3bfaf (Metraipolis archive dc_ab432cd3bfaf, sha256 f96d9885044983464b5c63c687b4836646d87e2a4ab70b07094afb9e45eb8e8a)
BibTeX
@misc{dcab432cd3bfaf,
  title = {Learned Parallel Bit-Flipping Sequential Belief Propagation Decoding of Quantum LDPC Codes — arXiv:2610.01068},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.01068},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ab432cd3bfaf; sha256 f96d9885044983464b5c63c687b4836646d87e2a4ab70b07094afb9e45eb8e8a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01068. 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 candidates for low-overhead fault-tolerant quantum computation, but their practical use requires fast, low-complexity, and reliable decoders. Belief propagation (BP) is attractive because of its local message-passing structure, yet standard flooding BP often suffers from convergence failures on QLDPC codes due to short cycles, degeneracy, and symmetric decoding trajectories. Learned sequential BP improves convergence by using a reinforcement-learning policy to choose variable-node update orders, but a single learned trajectory can still be sensitive to unfavorable local Pauli decisions. We propose a learned parallel bit-flipping sequential BP decoder with a new quaternary score combining syndrome gain, a quantized Pauli log-likelihood penalty, and Q-table lookahead at hypothetical post-flip states. Our decoder first runs learned sequential BP for a fixed number of iterations. If the syndrome is not satisfied, it constructs quaternary bit-flipping candidates, each corresponding to changing the current Pauli decision of one qubit. The selected candidates initialize independent learned sequential BP continuations from the same decoder state. Since these continuations are independent, they can be executed in parallel, so testing several candidates mainly increases parallel hardware resources rather than sequential decoding latency. Simulations on representative QLDPC codes over the depolarizing channel show that the proposed decoder improves the reliability of learned sequential BP while having a parallel low-latency structure.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.01068 — 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-06T16:13:30.459Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).