Performance enhancement of surface codes via recursive MWPM decoding

Abstract

The minimum weight perfect matching (MWPM) decoder is the standard decoding strategy for quantum surface codes. However, it suffers a harsh decrease in performance when subjected to biased or non-identical quantum noise. In this work, we modify the conventional MWPM decoder so that it considers the biases, the non-uniformities and the relationship between $X$, $Y$ and $Z$ errors of the constituent qubits of a given surface code. Our modified approach, which we refer to as the recursive MWPM decoder, obtains an $18\%$ improvement in the probability threshold $p_{th}$ under depolarizing noise. We also obtain significant performance improvements when considering biased noise and independent non-identically distributed (i.ni.d.) error models derived from measurements performed on state-of-the-art quantum processors. In fact, when subjected to i.ni.d. noise, the recursive MWPM decoder yields a performance improvement of $105.5\%$ over the conventional MWPM strategy and, in some cases, it even surpasses the performance obtained over the well-known depolarizing channel.

References in corpus (21)

• Fault-tolerant quantum computation by anyons
• Strong quantum computational advantage using a superconducting quantum processor
• Suppressing quantum errors by scaling a surface code logical qubit
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code
• Sparse Graph Codes for Quantum Error-Correction
• The XZZX Surface Code
• Fast Decoders for Topological Quantum Codes
• Degenerate Quantum LDPC Codes With Good Finite Length Performance
• Almost-linear time decoding algorithm for topological codes
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Decoding Across the Quantum LDPC Code Landscape
• Tailoring surface codes for highly biased noise
• Decoding Small Surface Codes with Feedforward Neural Networks
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• Cellular-automaton decoders for topological quantum memories
• Bias-tailored quantum LDPC codes
• A local pre-decoder to reduce the bandwidth and latency of quantum error correction
• Performance of surface codes in realistic quantum hardware
• Multi-qubit time-varying quantum channels for NISQ-era superconducting quantum processors

Cited by in corpus (8)

• Learning to Decode the Surface Code with a Recurrent, Transformer-Based Neural Network
• Decoding algorithms for surface codes
• Correcting non-independent and non-identically distributed errors with surface codes
• Error correction of transversal CNOT gates for scalable surface code computation
• Exact results on finite size corrections for surface codes tailored to biased noise
• Enhancing Quantum Memory Lifetime with Measurement-Free Local Error Correction and Reinforcement Learning
• Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes
• Self-attention U-Net decoder for toric codes