Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD

• URL: http://arxiv.org/abs/2507.00254v2
• Date: Tue, 08 Jul 2025 23:52:22 GMT
• Title: Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD
• Authors: Ming Wang, Ang Li, Frank Mueller,
• Abstract summary: We propose a lightweight decoder based solely on belief-propagation (BP)<n>Our method identifies unreliable bits via BP oscillation statistics, generates a set of modified test patterns, and decodes them in parallel using low-iteration BP.
• Score: 11.699137824558164
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we propose a lightweight decoder based solely on belief-propagation (BP), augmented with a speculative post-processing strategy inspired by classical Chase decoding. Our method identifies unreliable bits via BP oscillation statistics, generates a set of modified test patterns, and decodes them in parallel using low-iteration BP. We demonstrate that our approach can achieve logical error rates comparable to or even better than BP-OSD, but has lower latency over its parallelization for a variety of bivariate bicycle codes, which significantly reduces decoding complexity.

Related papers

• Improved belief propagation is sufficient for real-time decoding of quantum memory [0.7162404968344481]
  Relay-BP targets real-time quantum circuit decoding for large-scale quantum computers.<n>It achieves high accuracy across circuit-noise decoding problems.<n> Relay-BP is inherently parallel, enabling rapid low-footprint decoding with FPGA or ASIC real-time implementations.
  arXiv  Detail & Related papers  (2025-06-02T15:23:00Z)
• Accelerating Diffusion LLMs via Adaptive Parallel Decoding [50.9948753314669]
  We introduce adaptive parallel decoding (APD), a novel method that dynamically adjusts the number of tokens sampled in parallel.<n>APD provides markedly higher throughput with minimal quality degradations on downstream benchmarks.
  arXiv  Detail & Related papers  (2025-05-31T06:10:10Z)
• Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
  Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes.<n>We propose concrete criteria for threshold determination, backed by a closed form model.
  arXiv  Detail & Related papers  (2025-01-23T17:38:22Z)
• SymBreak: Mitigating Quantum Degeneracy Issues in QLDPC Code Decoders by Breaking Symmetry [13.97553415798807]
  Quantum low-density parity check (qLDPC) codes have emerged as a promising alternative, requiring fewer qubits.<n>SymBreak is a novel decoder for qLDPC codes that adaptively modifies the decoding graph to improve the performance of state-of-the-art belief propagation decoders.<n>Our results demonstrate that SymBreak outperforms BP and BP+OSD-a more complex variant of BP-with a $16.17times$ reduction in logical error rate compared to BP and $3.23times$ compared to BP+OSD across various qLDPC code families.
  arXiv  Detail & Related papers  (2024-12-03T22:45:43Z)
• Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation [55.8930142490617]
  We propose a decoder for QLDPC codes based on BP guided decimation (BPGD) BPGD significantly reduces the BP failure rate due to non-convergence.
  arXiv  Detail & Related papers  (2023-12-18T05:58:07Z)
• Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes [6.175503577352742]
  We propose a differentiable iterative decoder for quantum low-density parity-check (LDPC) codes. The proposed algorithm is composed of classical belief propagation (BP) decoding stages and intermediate graph neural network (GNN) layers.
  arXiv  Detail & Related papers  (2023-10-26T19:56:25Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• Refined Belief-Propagation Decoding of Quantum Codes with Scalar Messages [4.340338299803562]
  Codes based on sparse matrices have good performance and can be efficiently decoded by belief-propagation (BP) BP decoding of stabilizer codes suffers a performance loss from the short cycles in the underlying Tanner graph. We show that running BP with message normalization according to a serial schedule may significantly improve the decoding performance and error-floor in computer simulation.
  arXiv  Detail & Related papers  (2021-02-14T10:29:58Z)
• Pruning Neural Belief Propagation Decoders [77.237958592189]
  We introduce a method to tailor an overcomplete parity-check matrix to (neural) BP decoding using machine learning. We achieve performance within 0.27 dB and 1.5 dB of the ML performance while reducing the complexity of the decoder.
  arXiv  Detail & Related papers  (2020-01-21T12:05:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.