Metraipolis › archive › dc_ad64d823ffdc

High-Throughput Normalized Min-Sum Belief Propagation Decoding for Quantum LDPC Codes with Near-Memory Processing — arXiv:2608.27901

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27901
License (as archived)
CC0-1.0
Archived
2026-10-17T11:58:23.013Z
SHA-256 of the archived text
0db95662cfb00c69340d5b515c225c41a325826c96e761f02f582258a1cf0bdc
Stable URL of this page
https://metraipolis.com/documento/dc_ad64d823ffdc

How to cite

High-Throughput Normalized Min-Sum Belief Propagation Decoding for Quantum LDPC Codes with Near-Memory Processing — arXiv:2608.27901 — arXiv (en), https://arxiv.org/abs/2608.27901 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ad64d823ffdc (Metraipolis archive dc_ad64d823ffdc, sha256 0db95662cfb00c69340d5b515c225c41a325826c96e761f02f582258a1cf0bdc)
BibTeX
@misc{dcad64d823ffdc,
  title = {High-Throughput Normalized Min-Sum Belief Propagation Decoding for Quantum LDPC Codes with Near-Memory Processing — arXiv:2608.27901},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27901},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ad64d823ffdc; sha256 0db95662cfb00c69340d5b515c225c41a325826c96e761f02f582258a1cf0bdc},
  year = {2026}
}

Archived text

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

Real-time quantum error correction requires classical decoders to process growing syndrome workloads with low and predictable latency. For quantum low-density parity-check (qLDPC) codes, iterative belief propagation (BP) repeatedly updates messages over sparse Tanner graphs, creating substantial memory-access and data-movement demands. We map normalized Min-Sum BP decoding of the [[144,12,12]] Bivariate Bicycle qLDPC code onto a DPU-based Processing-in-Memory (PIM) architecture. Within each DPU, 11 tasklets cooperatively decode one syndrome, while multiple DPUs process independent syndrome instances in parallel. Using uPIMulator and a data-qubit Pauli error model with ideal syndrome measurements, we compare throughput, per-syndrome processing time, logical error rate (LER), and single-syndrome tail latency against a 16-logical-CPU baseline. At a component-wise physical error probability of p=0.001 and one BP iteration, the projected aggregate kernel throughput of 2,560 DPUs reaches 1.071 x 10^7 decodes/s, compared with 1.22 x 10^6 decodes/s for the CPU, an 8.8x improvement. From two iterations onward, the measured LER remains below the physical error probability for every evaluated value of p. For one to five iterations, the maximum sampled serialized X+Z DPU compute latency remains below the 1 ms decoder-side reference for trapped-ion QEC, reaching approximately 0.873 ms at five iterations. These results show that near-memory processing can provide high aggregate throughput and sub-millisecond compute latency for qLDPC BP decoding under the evaluated conditions.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-31 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.27901 — 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-17T11:28:37.502Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).