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 (117)
- Quantum Computing in the NISQ era and beyond
- Fault-tolerant quantum computation by anyons
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum cryptography: Public key distribution and coin tossing
- Surface codes: Towards practical large-scale quantum computation
- Quantum computational advantage using photons
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Noisy intermediate-scale quantum (NISQ) algorithms
- Topological quantum memory
- Quantum Error Correction for Quantum Memories
- 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
- Measurement-based quantum computation
- Quantum algorithms: an overview
- Open Quantum Systems. An Introduction
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- Photonic quantum information processing: a concise review
- Quantum Error Mitigation
- Surface code quantum computing by lattice surgery
- Quantum advantage in learning from experiments
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- Correcting Quantum Errors with Entanglement
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- High threshold universal quantum computation on the surface code
- High-threshold and low-overhead fault-tolerant quantum memory
- Stim: a fast stabilizer circuit simulator
- Superconducting Quantum Computing: A Review
- Sparse Graph Codes for Quantum Error-Correction
- Quantum codes on a lattice with boundary
- Codes for the Quantum Erasure Channel
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Quantum Low-Density Parity-Check Codes
- Decoherence benchmarking of superconducting qubits
- The computational complexity of PEPS
- Quantum Channel Capacity of Very Noisy Channels
- Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
- Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
- Symmetrised Characterisation of Noisy Quantum Processes
- The XZZX Surface Code
- Fast Decoders for Topological Quantum Codes
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Ultrahigh Error Threshold for Surface Codes with Biased Noise
- The prospects of quantum computing in computational molecular biology
- A Neural Decoder for Topological Codes
- Decoding Across the Quantum LDPC Code Landscape
- Topological and subsystem codes on low-degree graphs with flag qubits
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Single-shot fault-tolerant quantum error correction
- Quantum information processing with bosonic qubits in circuit QED
- Balanced Product Quantum Codes
- Correcting coherent errors with surface codes
- Tailoring surface codes for highly biased noise
- Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
- Decoding Small Surface Codes with Feedforward Neural Networks
- Catalytic quantum error correction
- Deep Neural Network Probabilistic Decoder for Stabilizer Codes
- Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
- Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes
- Quantum error correction for the toric code using deep reinforcement learning
- Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- Tensor Networks and Quantum Error Correction
- Deep neural decoders for near term fault-tolerant experiments
- Efficient Decoders for Qudit Topological Codes
- Improved decoding of circuit noise and fragile boundaries of tailored surface codes
- Fiber Bundle Codes: Breaking the Barrier for Quantum LDPC Codes
- Comparing neural network based decoders for the surface code
- Parallel window decoding enables scalable fault tolerant quantum computation
- Understanding the effects of leakage in superconducting quantum error detection circuits
- Reinforcement Learning Decoders for Fault-Tolerant Quantum Computation
- Experimentally scalable protocol for identification of correctable codes
- Cellular-automaton decoders with provable thresholds for topological codes
- Neural network decoder for topological color codes with circuit level noise
- Cellular-automaton decoders for topological quantum memories
- Deterministic correction of qubit loss
- A fast fault-tolerant decoder for qubit and qudit surface codes
- Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
- Efficient Decoding of Topological Color Codes
- Continuous quantum error correction for non-Markovian decoherence
- Multi-path Summation for Decoding 2D Topological Codes
- 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
- Reinforcement learning for optimal error correction of toric codes
- Optimal complexity correction of correlated errors in the surface code
- Neural Network Decoders for Large-Distance 2D Toric Codes
- Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
- Deep Q-learning decoder for depolarizing noise on the toric code
- Techniques for combining fast local decoders with global decoders under circuit-level noise
- Learning correlated noise in a 39-qubit quantum processor
- Efficient color code decoders in dimensions from toric code decoders
- General tensor network decoding of 2D Pauli codes
- A simple decoder for topological codes
- Renormalization group decoder for a four-dimensional toric code
- Pauli channels can be estimated from syndrome measurements in quantum error correction
- Correcting non-independent and non-identically distributed errors with surface codes
- On Clifford groups in quantum computing
- A decoding algorithm for CSS codes using the X/Z correlations
- Log-domain decoding of quantum LDPC codes over binary finite fields
- Symmetries for a High Level Neural Decoder on the Toric Code
- Performance enhancement of surface codes via recursive MWPM decoding
- Determination of the Semion Code Threshold using Neural Decoders
- Multi-qubit time-varying quantum channels for NISQ-era superconducting quantum processors
- Single Quantum Deletion Error-Correcting Codes
- Zero noise extrapolation on logical qubits by scaling the error correction code distance
- Minimum weight perfect matching of fault-tolerant topological quantum error correction in average parallel time
- Improved quantum error correction using soft information
- An interpretation of Union-Find Decoder on Weighted Graphs
- Software Tools for Decoding Quantum Low-Density Parity Check Codes
- 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