Evolutionary BP+OSD Decoding for Low-Latency Quantum Error Correction

• URL: http://arxiv.org/abs/2512.18273v1
• Date: Sat, 20 Dec 2025 08:29:43 GMT
• Title: Evolutionary BP+OSD Decoding for Low-Latency Quantum Error Correction
• Authors: Hee-Youl Kwak, Seong-Joon Park, Hyunwoo Jung, Jeongseok Ha, Jae-Won Kim,
• Abstract summary: We propose an evolutionary belief propagation decoder for quantum error correction, which incorporates trainable weights into the BP algorithm and optimize them via the differential evolution algorithm.<n> Experimental results show that EBP+OSD achieves better decoding performance and lower computational complexity than BP+OSD, particularly under strict low latency constraints.
• Score: 7.798982496438193
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose an evolutionary belief propagation (EBP) decoder for quantum error correction, which incorporates trainable weights into the BP algorithm and optimizes them via the differential evolution algorithm. This approach enables end-to-end optimization of the EBP combined with ordered statistics decoding (OSD). Experimental results on surface codes and quantum low-density parity-check codes show that EBP+OSD achieves better decoding performance and lower computational complexity than BP+OSD, particularly under strict low latency constraints (within 5 BP iterations).

Related papers

• Unbiased Dynamic Pruning for Efficient Group-Based Policy Optimization [60.87651283510059]
  Group Relative Policy Optimization (GRPO) effectively scales LLM reasoning but incurs prohibitive computational costs.<n>We propose Dynamic Pruning Policy Optimization (DPPO), a framework that enables dynamic pruning while preserving unbiased gradient estimation.<n>To mitigate the data sparsity induced by pruning, we introduce Dense Prompt Packing, a window-based greedy strategy.
  arXiv  Detail & Related papers  (2026-03-04T14:48:53Z)
• Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes [0.9558392439655014]
  Quantum low-density parity-check (qLDPC) codes are promising for realizing scalable fault-tolerant quantum computation.<n>A common approach to decoding qLDPC codes is to use the belief propagation (BP) decoder, followed by a post-processing step to enhance decoding accuracy.<n>For real-time decoding, the post-processing algorithm is desirable to have a small computational cost and rely only on local operations on the Tanner graph to facilitate parallel implementation.<n>We propose degeneracy cutting (DC), an efficient post-processing technique for the BP decoder that operates on information restricted to the support of each stabilizer
  arXiv  Detail & Related papers  (2025-10-09T18:01:30Z)
• Accelerating BP-OSD Decoder for QLDPC Codes with Local Syndrome-Based Preprocessing [4.392193109807139]
  Low-density parity-check (QLDPC) codes are one of the most promising quantum error correction methods.<n>BP-OSD is the state-of-the-art decoder for QLDPC codes, but it suffers from high decoding latency.<n>We propose a lightweight preprocessing step that utilizes local syndrome patterns to detect likely trivial error events.
  arXiv  Detail & Related papers  (2025-09-02T02:30:02Z)
• Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD [11.699137824558164]
  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.
  arXiv  Detail & Related papers  (2025-06-30T20:47:28Z)
• Efficient Approximate Degenerate Ordered Statistics Decoding for Quantum Codes via Reliable Subset Reduction [5.625796693054094]
  We introduce the concept of approximate degenerate decoding and integrate it with ordered statistics decoding (OSD)<n>We present an ADOSD algorithm that significantly improves OSD efficiency in the code capacity noise model.
  arXiv  Detail & Related papers  (2024-12-30T17:45:08Z)
• Improved Belief Propagation Decoding Algorithms for Surface Codes [5.916355710767515]
  Belief propagation (BP) is notable for its nearly linear time complexity and general applicability to stabilizer codes.<n>This article focuses on improving the decoding accuracy of BP over GF(4) for surface codes.<n>We propose EWAInit-BP, which adaptively updates initial probabilities and provides a 1 to 3 orders of magnitude improvement over traditional BP.
  arXiv  Detail & Related papers  (2024-07-16T09:03:06Z)
• 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)
• 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)
• Exact Optimization of Conformal Predictors via Incremental and Decremental Learning [46.9970555048259]
  Conformal Predictors (CP) are wrappers around ML methods, providing error guarantees under weak assumptions on the data distribution. They are suitable for a wide range of problems, from classification and regression to anomaly detection. We show that it is possible to speed up a CP classifier considerably, by studying it in conjunction with the underlying ML method, and by exploiting incremental&decremental learning.
  arXiv  Detail & Related papers  (2021-02-05T15:31:37Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Belief Propagation Neural Networks [103.97004780313105]
  We introduce belief propagation neural networks (BPNNs) BPNNs operate on factor graphs and generalize Belief propagation (BP) We show that BPNNs converges 1.7x faster on Ising models while providing tighter bounds. On challenging model counting problems, BPNNs compute estimates 100's of times faster than state-of-the-art handcrafted methods.
  arXiv  Detail & Related papers  (2020-07-01T07:39:51Z)

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.