Low-weight quantum syndrome errors in belief propagation decoding

• URL: http://arxiv.org/abs/2603.19126v1
• Date: Thu, 19 Mar 2026 16:46:53 GMT
• Title: Low-weight quantum syndrome errors in belief propagation decoding
• Abstract summary: We analyze the dynamics of iterations when BP is used to decode weight-four and weight-five errors.<n>We show that the suggested decoder amendment can result in the reduction of both logical errors and decoding time.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We describe an empirical approach to identify low-weight combinations of columns of the decoding matrices of a quantum circuit-level noise model, for which belief-propagation (BP) algorithms converge possibly very slowly. Focusing on the logical-idle syndrome cycle of the low-density parity check gross code, we identify criteria providing a characterization of the Tanner subgraph of such low-weight error syndromes. We analyze the dynamics of iterations when BP is used to decode weight-four and weight-five errors, finding statistics akin to exponential activation in the presence of noise or escape from chaotic phase-space domains. We study how BP convergence improves when adding to the decoding matrix relevant combinations of fault columns, and show that the suggested decoder amendment can result in the reduction of both logical errors and decoding time.

Related papers

• Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction [4.530862878671599]
  We show that appending linearly independent rows to a check matrix of a stabilizer code can reduce the search space for a valid solution.<n>We extend the recently proposed affine subcode ensemble decoding technique from the classical to the quantum setting.
  arXiv  Detail & Related papers  (2026-05-07T16:43:32Z)
• Syndrome resampling enhances quantum error correction thresholds [0.9744114320491685]
  We introduce syndrome resampling, a method that increases QEC thresholds of any decoder.<n>We show that syndrome resampling substantially increases thresholds for both optimal and suboptimal decoders.<n>Applying the method to existing experimental QEC data yields up to two orders of magnitude reduction in logical error rates.
  arXiv  Detail & Related papers  (2026-05-07T12:16:39Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Bosonic quantum computing with near-term devices and beyond [0.0]
  This thesis investigates scalable fault-tolerant quantum computation.<n>We develop bosonic quantum codes, quantum LDPC codes, and decoding protocols that connect continuous-variable and discrete-variable error correction.
  arXiv  Detail & Related papers  (2025-12-17T04:01:54Z)
• Decoding Multimode Gottesman-Kitaev-Preskill Codes with Noisy Auxiliary States [0.0]
  We show that leveraging the correlations between measurement results and the actual error affecting the multimode GKP state can decrease the logical error probability by at least an order of magnitude.
  arXiv  Detail & Related papers  (2025-10-14T16:14:33Z)
• 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)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise [6.322831694506286]
  We introduce quantum data-syndrome codes along with a generalized check matrix that integrates both quaternary and binary alphabets to represent diverse error sources.<n>We observe that at high error rates, fewer rounds of syndrome extraction tend to perform better, while more rounds improve performance at lower error rates.
  arXiv  Detail & Related papers  (2023-10-19T12:23:05Z)
• 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)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)

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.