A blindness property of the Min-Sum decoding for the toric code
arXiv:2406.14968 · doi:10.1109/jsait.2025.3571313
Abstract
Kitaev's toric code is one of the most prominent models for fault-tolerant quantum computation, currently regarded as the leading solution for connectivity constrained quantum technologies. Significant effort has been recently devoted to improving the error correction performance of the toric code under message-passing decoding, a class of low-complexity, iterative decoding algorithms that play a central role in both theory and practice of classical low-density parity-check codes. Here, we provide a theoretical analysis of the toric code under min-sum (MS) decoding, a message-passing decoding algorithm known to solve the maximum-likelihood decoding problem in a localized manner, for codes defined by acyclic graphs. Our analysis reveals an intrinsic limitation of the toric code, which confines the propagation of local information during the message-passing process. We show that if the unsatisfied checks of an error syndrome are at distance greater or equal to 5 from each other, then the MS decoding is locally blind: the qubits in the direct neighborhood of an unsatisfied check are never aware of any other unsatisfied checks, except their direct neighbor. Moreover, we show that degeneracy is not the only cause of decoding failures for errors of weight at least 4, that is, the MS non-degenerate decoding radius is equal to 3, for any toric code of distance greater or equal to 9. Finally, complementing our theoretical analysis, we present a pre-processing method of practical relevance. The proposed method, referred to as stabiliser-blowup, has linear complexity and allows correcting all (degenerate) errors of weight up to 3, providing quadratic improvement in the logical error rate performance, as compared to MS only.
References in corpus (11)
- Suppressing quantum errors by scaling a surface code logical qubit
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Decoding Across the Quantum LDPC Code Landscape
- Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes
- Comparing neural network based decoders for the surface code
- Enhanced Feedback Iterative Decoding of Sparse Quantum Codes
- Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
- Modified belief propagation decoders for quantum low-density parity-check codes
- Generalized Belief Propagation Algorithms for Decoding of Surface Codes
- Check-Agnosia based Post-Processor for Message-Passing Decoding of Quantum LDPC Codes
- A blindness property of the Min-Sum decoding for the toric code