Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes
arXiv:2506.14745 · doi:10.1109/JSAIT.2025.3581810
Abstract
In this paper, we introduce the Union-Intersection Union-Find (UIUF) algorithm for decoding depolarizing errors in topological codes, combining the strengths of iterative and standard Union-Find (UF) decoding. While iterative UF improves performance at moderate error rates, it lacks an error correction guarantee. To address this, we develop UIUF, which maintains the enhanced performance of iterative UF while ensuring error correction up to half the code distance. Through simulations under code capacity, phenomenological, and biased noise models, we show that UIUF significantly outperforms UF, reducing the logical error rate by over an order of magnitude (at around ). Moreover, UIUF achieves lower logical error rates than the Minimum Weight Perfect Matching (MWPM) decoder on rotated surface codes under both the code capacity and phenomenological noise models, while preserving efficient linear-time complexity.
13 pages, 17 figures
References in corpus (19)
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Fault-tolerant quantum computation with high threshold in two dimensions
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Decoding Across the Quantum LDPC Code Landscape
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Sparse Blossom: correcting a million errors per core second with minimum-weight matching
- Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
- Entanglement-Assisted Quantum Error-Correcting Codes with Imperfect Ebits
- Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
- Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
- Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
- A decoding algorithm for CSS codes using the X/Z correlations
- Pipelined correlated minimum weight perfect matching of the surface code
- Performance enhancement of surface codes via recursive MWPM decoding
- Actis: A Strictly Local Union-Find Decoder
- Union-find quantum decoding without union-find
- On Belief Propagation Decoding of Quantum Codes with Quaternary Reliability Statistics
- Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise