Multi-path Summation for Decoding 2D Topological Codes

Abstract

Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a decoder which can adapt to the wide variety of error models present in experiments. The typical approach to the problem of decoding the surface code is to reduce it to minimum-weight perfect matching in a way that provides a suboptimal threshold error rate, and is specialized to correct a specific error model. Recently, optimal threshold error rates for a variety of error models have been obtained by methods which do not use minimum-weight perfect matching, showing that such thresholds can be achieved in polynomial time. It is an open question whether these results can also be achieved by minimum-weight perfect matching. In this work, we use belief propagation and a novel algorithm for producing edge weights to increase the utility of minimum-weight perfect matching for decoding surface codes. This allows us to correct depolarizing errors using the rotated surface code, obtaining a threshold of $17.76\pm 0.02\%$. This is larger than the threshold achieved by previous matching-based decoders ($14.88\pm 0.02\%$), though still below the known upper bound of $\sim 18.9\%$.

19 pages, 13 figures, published in Quantum, available at https://quantum-journal.org/papers/q-2018-10-19-102/

References in corpus (5)

• The NumPy array: a structure for efficient numerical computation
• Quantum Error Correction
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Improved HDRG decoders for qudit and non-Abelian quantum error correction

Cited by in corpus (31)

• Suppressing quantum errors by scaling a surface code logical qubit
• Quantum Error Correction: An Introductory Guide
• Decoding Across the Quantum LDPC Code Landscape
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• Advantages of versatile neural-network decoding for topological codes
• Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
• Parallelized quantum error correction with fracton topological codes
• Analysing correlated noise on the surface code using adaptive decoding algorithms
• Decoding algorithms for surface codes
• Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
• Bias-tailored quantum LDPC codes
• General tensor network decoding of 2D Pauli codes
• Correcting non-independent and non-identically distributed errors with surface codes
• The XYZ${}^2$ hexagonal stabilizer code
• The role of entropy in topological quantum error correction
• A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing
• Data-driven decoding of quantum error correcting codes using graph neural networks
• Neural network decoder for near-term surface-code experiments
• Correcting spanning errors with a fractal code
• Actis: A Strictly Local Union-Find Decoder
• Improved Belief Propagation Decoding Algorithms for Surface Codes
• Error-rate-agnostic decoding of topological stabilizer codes
• Quantum message-passing algorithm for optimal and efficient decoding
• Detrimental non-Markovian errors for surface code memory
• Decoherence and Quantum Error Correction for Quantum Computing and Communications
• Qudit vs. Qubit: Simulated performance of error correction codes in higher dimensions
• Enhancing Quantum Memory Lifetime with Measurement-Free Local Error Correction and Reinforcement Learning
• Minimising surface-code failures using a color-code decoder
• Mitigating Temporal Fragility in the XY Surface Code
• Decoding Correlated Errors in Quantum LDPC Codes
• Hierarchical Quantum Error Correction with Hypergraph Product Code and Rotated Surface Code