Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
arXiv:1703.01517 · doi:10.1103/PhysRevResearch.2.033042
Abstract
Surface codes are among the best candidates to ensure the fault-tolerance of a quantum computer. In order to avoid the accumulation of errors during a computation, it is crucial to have at our disposal a fast decoding algorithm to quickly identify and correct errors as soon as they occur. We propose a linear-time maximum likelihood decoder for surface codes over the quantum erasure channel. This decoding algorithm for dealing with qubit loss is optimal both in terms of performance and speed.
References in corpus (9)
- Surface codes: Towards practical large-scale quantum computation
- Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence
- Resource-efficient linear optical quantum computation
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Experimental demonstration of graph-state quantum secret sharing
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Constructions and Noise Threshold of Hyperbolic Surface Codes
- Fault-tolerant logical gates in quantum error-correcting codes
- Ultrafast Long-Distance Quantum Communication with Static Linear Optics
Cited by in corpus (52)
- Almost-linear time decoding algorithm for topological codes
- Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
- Sparse Blossom: correcting a million errors per core second with minimum-weight matching
- High threshold codes for neutral atom qubits with biased erasure errors
- Dual-rail encoding with superconducting cavities
- Quantum coding with low-depth random circuits
- Quantum Error Correction with the Semion Code
- Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
- Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
- Scalable Neural Decoder for Topological Surface Codes
- Decoding algorithms for surface codes
- Optimization of the surface code design for Majorana-based qubits
- Crystalline Quantum Circuits
- Adaptive surface code for quantum error correction in the presence of temporary or permanent defects
- Optimal local unitary encoding circuits for the surface code
- Tailoring fusion-based error correction for high thresholds to biased fusion failures
- A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing
- Fast erasure decoder for hypergraph product codes
- Erasure Decoding for Quantum LDPC Codes via Belief Propagation with Guided Decimation
- Actis: A Strictly Local Union-Find Decoder
- LILLIPUT: A Lightweight Low-Latency Lookup-Table Based Decoder for Near-term Quantum Error Correction
- Mitigating errors in logical qubits
- Improved quantum error correction using soft information
- Modular architectures to deterministically generate graph states
- Union-find quantum decoding without union-find
- Interleaving: Modular architectures for fault-tolerant photonic quantum computing
- Alibaba Cloud Quantum Development Platform: Surface Code Simulations with Crosstalk
- Spanning Tree Matching Decoder for Quantum Surface Codes
- Surface Code with Imperfect Erasure Checks
- Spatially parallel decoding for multi-qubit lattice surgery
- Golden codes: quantum LDPC codes built from regular tessellations of hyperbolic 4-manifolds
- Fault-tolerant structures for measurement-based quantum computation on a network
- Union-Find Decoders For Homological Product Codes
- Quantum Network Routing based on Surface Code Error Correction
- Classical product code constructions for quantum Calderbank-Shor-Steane codes
- Degenerate quantum erasure decoding
- Efficiently decoding the 3D toric codes and welded codes on cubic lattices
- Rescaling decoder for 2D topological quantum color codes on 4.8.8 lattices
- Stabilizing Non-Abelian Topological Order against Heralded Noise via Local Lindbladian Dynamics
- Fundamental thresholds for computational and erasure errors via the coherent information
- On the Local Equivalence of 2D Color Codes and Surface Codes with Applications
- Coherent Information Phase Transition in a Noisy Quantum Circuit
- Enhancing Quantum Memory Lifetime with Measurement-Free Local Error Correction and Reinforcement Learning
- Finite-rate sparse quantum codes aplenty
- Practical Quantum Computing: The value of local computation
- Multiplexed Quantum Communication with Surface and Hypergraph Product Codes
- Dynamically generated concatenated codes and their phase diagrams
- Almost Linear Decoder for Optimal Geometrically Local Quantum Codes
- Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes
- Measurement-free reconstruction circuit of quantum secrets in quantum secret sharing
- Combinatorial Solution of the Syndrome Decoding Problem using Copula on Grassmann graph
- Snowflake: A Distributed Streaming Decoder