Accelerating BP-OSD Decoder for QLDPC Codes with Local Syndrome-Based Preprocessing

• URL: http://arxiv.org/abs/2509.01892v1
• Date: Tue, 02 Sep 2025 02:30:02 GMT
• Title: Accelerating BP-OSD Decoder for QLDPC Codes with Local Syndrome-Based Preprocessing
• Authors: Wenxuan Fan, Yasunari Suzuki, Gokul Subramanian Ravi, Yosuke Ueno, Koji Inoue, Teruo Tanimoto,
• Abstract summary: 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.
• Score: 4.392193109807139
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Due to the high error rate of qubits, detecting and correcting errors is essential for achieving fault-tolerant quantum computing (FTQC). Quantum low-density parity-check (QLDPC) codes are one of the most promising quantum error correction (QEC) methods due to their high encoding rates. Belief Propagation-Ordered Statistics Decoding (BP-OSD) is the state-of-the-art decoder for QLDPC codes, but it suffers from high decoding latency. We find from experiments that a large portion of this latency originates from the iterative BP stage, making BP runtime reduction a key optimization target. In this paper, we propose a lightweight preprocessing step that utilizes local syndrome patterns to detect likely trivial error events and feed them as hints into BP-OSD. These hints reduce the number of BP iterations and the overall decoding time. On Bivariate Bicycle codes, the proposed method achieves more than an 80% reduction in BP iterations and total decoding time for the $[[144,12,12]]$ code at a physical error rate of 0.05%, while maintaining the original logical error rate of BP-OSD.

Related papers

• 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)
• 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)
• 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)
• Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes [0.0]
  We introduce the Ambiguity Clustering decoder (AC) which divides measurement data into clusters that can be decoded independently.<n>With 0.3% circuit-level depolarising noise, AC is up to 27x faster than BP-OSD with matched accuracy.<n>Our implementation decodes the 144-qubit Gross code in 135us per round of syndrome extraction on an M2 CPU.
  arXiv  Detail & Related papers  (2024-06-20T17:39:31Z)
• 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)
• Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with Overcomplete Check Matrices [45.997444794696676]
  Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers.<n>One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder.<n>We first propose to decode QLDPC codes with a belief propagation (BP) decoder operating on overcomplete check matrices.<n>We extend the neural BP (NBP) decoder, which was originally studied for suboptimal binary BP decoding of QLPDC codes, to quaternary BP decoders.
  arXiv  Detail & Related papers  (2023-08-16T08:24:06Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• 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)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• 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.