Towards Scalable Quaternary Message-Passing Decoding for Quantum Error Correction

• URL: http://arxiv.org/abs/2605.24177v1
• Date: Fri, 22 May 2026 19:57:24 GMT
• Title: Towards Scalable Quaternary Message-Passing Decoding for Quantum Error Correction
• Abstract summary: This work takes a step toward a more principled and interpretable MP decoding framework.<n>We introduce a dilution method, which allows a quaternary Min-Sum (MS) decoder to exhibit an apparent depolarizing threshold.<n>For $X$-noise, the standard MS decoder under dilution has worst-case complexity $O(N log2 d)$ and outperforms BP-OSD at $d=65$.
• Score: 6.120106694667796
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The scalability and interpretability of message-passing (MP) decoding, such as (quaternary) Belief Propagation, remain open challenges in quantum error correction. Even for surface codes, arguably the first testbed for decoding methods, studies of improved MP decoders have mostly been restricted to small distances ($d \lesssim 19$). Moreover, the mismatch with established message-passing theory limits the decoder's interpretability, making it unclear whether MP decoding can sustain its effectiveness at large system sizes. This work takes a step toward a more principled and interpretable MP decoding framework, with the goal of making MP-based decoding more reliable and bridging theory and practice. We introduce a dilution method, which allows a quaternary Min-Sum (MS) decoder to exhibit an apparent depolarizing threshold of $16\%$ up to distance $20$, outperforming Minimum-Weight Perfect Matching in finite-length regimes. Notably, for $X$-noise, the standard MS decoder under dilution has worst-case complexity $O(N \log^2 d)$ and outperforms BP-OSD at $d=65$. The observed $\sim 9\%$ threshold may correspond to a true asymptotic threshold. Finally, we give a graph-dilution argument that interprets the success of the dilution method and offers insight into when MP algorithms can genuinely scale. Taken together, these results provide encouraging progress toward scalable and interpretable MP decoding in quantum error correction.

Related papers

• Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes [45.91504150103373]
  We study a quantum error mitigation method known as probabilistic error cancellation in the context of the Gottesman-Kitaev-Preskill code.<n>We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations.
  arXiv  Detail & Related papers  (2026-09-15T12:29:45Z)
• Quantum error correction at ultra-low overhead [0.0]
  Suppressing errors is the central challenge for useful large-scale quantum computing.<n>We introduce Cornucopia codes, a family of practical, hardware-efficient quantum low-density parity-check codes.<n>Results bring demonstrations of ultra-low overhead quantum error correction within the reach of near-term quantum processors.
  arXiv  Detail & Related papers  (2026-08-03T18:13:57Z)
• Optimal Decoding for Measurement-Based GHZ State Preparation: The Maximum-Utility Decoder [0.0]
  We present an algorithm that achieves the highest possible pershot decoded quantum order.<n>We then establish an optimal decoding strategy for measurement-based G-state preparation.<n>A two-stage decoder is developed that first encodes into the edge weights of MWPM and then refines the result with a convolutional neural network trained to maximize expected utility.
  arXiv  Detail & Related papers  (2026-07-31T18:00:00Z)
• Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation [0.43553942673960666]
  We introduce a convolutional neural network decoder that exploits the geometric structure of QEC codes.<n>We show that the logical error rates required for large-scale fault-tolerant algorithms are attainable with modest code sizes.<n>Results suggest that the space-time costs associated with fault-tolerant quantum computation may be significantly lower than previously anticipated.
  arXiv  Detail & Related papers  (2026-04-09T15:21:41Z)
• Enhancing Fault-Tolerant Surface Code Decoding with Iterative Lattice Reweighting [12.330043396100635]
  We introduce the Iterative Reweighting Minimum-Weight Perfect Matching (IRMWPM) decoder.<n>We show that IRMWPM reduces logical error rates by over 20x with only a few distances.<n>It also raises the accuracy threshold from 1% to 1.16%, making it practical for near-term real-time decoding.
  arXiv  Detail & Related papers  (2025-09-08T14:45:59Z)
• Minimum-Weight Parity Factor Decoder for Quantum Error Correction [5.5312585333158495]
  HyperBlossom is a unified framework that formulates MLE decoding as a Minimum-Weight Parity Factor problem.<n>HyperBlossom unifies all the existing graph-based decoders like (Hypergraph) Union-Find decoders and Minimum-Weight Perfect Matching (MWPM) decoders.<n>HyperBlossom achieves a 4.8x lower logical error rate compared to the MWPM decoder on the distance-11 surface code.
  arXiv  Detail & Related papers  (2025-08-07T01:44:34Z)
• Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder.<n>We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• 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)
• 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)
• 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)
• Low overhead fault-tolerant quantum error correction with the surface-GKP code [60.44022726730614]
  We propose a highly effective use of the surface-GKP code, i.e., the surface code consisting of bosonic GKP qubits instead of bare two-dimensional qubits. We show that a low logical failure rate $p_L 10-7$ can be achieved with moderate hardware requirements.
  arXiv  Detail & Related papers  (2021-03-11T23:07:52Z)

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.