Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
arXiv:2004.04693 · doi:10.1103/PhysRevA.102.012419
Abstract
Quantum error correction requires decoders that are both accurate and efficient. To this end, union-find decoding has emerged as a promising candidate for error correction on the surface code. In this work, we benchmark a weighted variant of the union-find decoder on the toric code under circuit-level depolarizing noise. This variant preserves the almost-linear time complexity of the original while significantly increasing the performance in the fault-tolerance setting. In this noise model, weighting the union-find decoder increases the threshold from 0.38% to 0.62%, compared to an increase from 0.65% to 0.72% when weighting a matching decoder. Further assuming quantum non-demolition measurements, weighted union-find decoding achieves a threshold of 0.76% compared to the 0.90% threshold when matching. We additionally provide comparisons of timing as well as low error rate behavior.
6 pages, 5 figures, comments welcome
References in corpus (36)
- Fault-tolerant quantum computation by anyons
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological fault-tolerance in cluster state quantum computation
- High threshold universal quantum computation on the surface code
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Fast Decoders for Topological Quantum Codes
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Towards practical classical processing for the surface code
- A Neural Decoder for Topological Codes
- Topological and subsystem codes on low-degree graphs with flag qubits
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Tailoring surface codes for highly biased noise
- Poking holes and cutting corners to achieve Clifford gates with the surface code
- Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
- Decoding Small Surface Codes with Feedforward Neural Networks
- High threshold error correction for the surface code
- Universal topological phase of 2D stabilizer codes
- Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
- Triangular color codes on trivalent graphs with flag qubits
- Deep neural decoders for near term fault-tolerant experiments
- Advantages of versatile neural-network decoding for topological codes
- An efficient Markov chain Monte Carlo algorithm for the surface code
- Cellular-automaton decoders with provable thresholds for topological codes
- A fast fault-tolerant decoder for qubit and qudit surface codes
- Analysing correlated noise on the surface code using adaptive decoding algorithms
- Towards practical classical processing for the surface code: timing analysis
- Topological code Autotune
- 2-D Compass Codes
- Cellular automaton decoders of topological quantum memories in the fault tolerant setting
- A simple decoder for topological codes
- Generating Fault-Tolerant Cluster States from Crystal Structures
- Fault-tolerant Compass Codes
Cited by in corpus (32)
- 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
- A Fault-Tolerant Honeycomb Memory
- Low overhead fault-tolerant quantum error correction with the surface-GKP code
- Improved decoding of circuit noise and fragile boundaries of tailored surface codes
- Quantum Error Correction with Metastable States of Trapped Ions Using Erasure Conversion
- Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
- Decoding algorithms for surface codes
- Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
- Optimization of the surface code design for Majorana-based qubits
- A decoder for the triangular color code by matching on a Möbius strip
- Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
- Techniques for combining fast local decoders with global decoders under circuit-level noise
- FPGA-based Distributed Union-Find Decoder for Surface Codes
- Pauli channels can be estimated from syndrome measurements in quantum error correction
- Conservation laws and quantum error correction: towards a generalised matching decoder
- Data-driven decoding of quantum error correcting codes using graph neural networks
- Fast erasure decoder for hypergraph product codes
- Actis: A Strictly Local Union-Find Decoder
- Error-rate-agnostic decoding of topological stabilizer codes
- Improving threshold for fault-tolerant color code quantum computing by flagged weight optimization
- Union-find quantum decoding without union-find
- Surface Code with Imperfect Erasure Checks
- Minimising surface-code failures using a color-code decoder
- Practical quantum error correction with the XZZX code and Kerr-cat qubits
- Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes
- Self-attention U-Net decoder for toric codes
- Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory
- Bayesian inference of general noise-model parameters from the syndrome statistics of surface codes
- Between Shor and Steane: A unifying construction for measuring error syndromes
- Neural Decoders for Universal Quantum Algorithms
- Snowflake: A Distributed Streaming Decoder