Decoding algorithms for surface codes
arXiv:2307.14989 · doi:10.22331/q-2024-10-10-1498
Abstract
Quantum technologies have the potential to solve certain computationally hard problems with polynomial or super-polynomial speedups when compared to classical methods. Unfortunately, the unstable nature of quantum information makes it prone to errors. For this reason, quantum error correction is an invaluable tool to make quantum information reliable and enable the ultimate goal of fault-tolerant quantum computing. Surface codes currently stand as the most promising candidates to build near term error corrected qubits given their two-dimensional architecture, the requirement of only local operations, and high tolerance to quantum noise. Decoding algorithms are an integral component of any error correction scheme, as they are tasked with producing accurate estimates of the errors that affect quantum information, so that they can subsequently be corrected. A critical aspect of decoding algorithms is their speed, since the quantum state will suffer additional errors with the passage of time. This poses a connundrum, where decoding performance is improved at the expense of complexity and viceversa. In this review, a thorough discussion of state-of-the-art decoding algorithms for surface codes is provided. The target audience of this work are both readers with an introductory understanding of the field as well as those seeking to further their knowledge of the decoding paradigm of surface codes. We describe the core principles of these decoding methods as well as existing variants that show promise for improved results. In addition, both the decoding performance, in terms of error correction capability, and decoding complexity, are compared. A review of the existing software tools regarding surface codes decoding is also provided.
59 pages, 38 figures
References in corpus (49)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Surface codes: Towards practical large-scale quantum computation
- Quantum computational advantage using photons
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum computing with trapped ions
- Strong quantum computational advantage using a superconducting quantum processor
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- Quantum Error Mitigation
- Quantum advantage in learning from experiments
- Correcting Quantum Errors with Entanglement
- High-threshold and low-overhead fault-tolerant quantum memory
- Stim: a fast stabilizer circuit simulator
- Quantum Low-Density Parity-Check Codes
- Decoherence benchmarking of superconducting qubits
- Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
- Symmetrised Characterisation of Noisy Quantum Processes
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- The prospects of quantum computing in computational molecular biology
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Balanced Product Quantum Codes
- Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- Improved decoding of circuit noise and fragile boundaries of tailored surface codes
- Fiber Bundle Codes: Breaking the Barrier for Quantum LDPC Codes
- Parallel window decoding enables scalable fault tolerant quantum computation
- Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
- Continuous quantum error correction for non-Markovian decoherence
- Improved single-shot decoding of higher dimensional hypergraph product codes
- Bias-tailored quantum LDPC codes
- Improved HDRG decoders for qudit and non-Abelian quantum error correction
- Tailored XZZX codes for biased noise
- Techniques for combining fast local decoders with global decoders under circuit-level noise
- Learning correlated noise in a 39-qubit quantum processor
- General tensor network decoding of 2D Pauli codes
- Pauli channels can be estimated from syndrome measurements in quantum error correction
- Correcting non-independent and non-identically distributed errors with surface codes
- Log-domain decoding of quantum LDPC codes over binary finite fields
- Performance enhancement of surface codes via recursive MWPM decoding
- Multi-qubit time-varying quantum channels for NISQ-era superconducting quantum processors
- Zero noise extrapolation on logical qubits by scaling the error correction code distance
- Improved quantum error correction using soft information
- Software Tools for Decoding Quantum Low-Density Parity Check Codes
- An interpretation of Union-Find Decoder on Weighted Graphs
- Decoherence and Quantum Error Correction for Quantum Computing and Communications
- On the iterative decoding of sparse quantum codes
- A Modified MWPM Decoding Algorithm for Quantum Surface Codes Over Depolarizing Channels
Cited by in corpus (16)
- Creating entangled logical qubits in the heavy-hex lattice with topological codes
- Spanning Tree Matching Decoder for Quantum Surface Codes
- Degenerate quantum erasure decoding
- Introduction to Quantum Error Correction with Stabilizer Codes
- Single-shot preparation of hypergraph product codes via dimension jump
- Hacking Cryptographic Protocols with Advanced Variational Quantum Attacks
- Distributed Realization of Color Codes for Quantum Error Correction
- Non-local resources for error correction in quantum LDPC codes
- Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks
- Generalizing the matching decoder for the Chamon code
- Hardness results for decoding the surface code with Pauli noise
- Decoding Correlated Errors in Quantum LDPC Codes
- iSwitch: QEC on Demand via In-Situ Encoding of Bare Qubits for Ion Trap Architectures
- Feedforward suppression of readout-induced faults in quantum error correction
- Superselection-Resolved Entanglement in Lattice Gauge Theories: A Tensor Network Approach
- Fault-Tolerant Encoding of Logical Qudits in Spin Systems