A fast fault-tolerant decoder for qubit and qudit surface codes
arXiv:1411.3028 · doi:10.1103/PhysRevA.92.032309
Abstract
The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes the operations needed to correct or compensate for the errors according to the measured syndrome, even when the measurement itself is error prone. Previously decoders based on minimum-weight perfect matching have been studied. However, these are not immediately generalizable from qubit to qudit codes. In this work, we develop a fault-tolerant decoder for the surface code, capable of efficient operation for qubits and qudits of any dimension, generalizing the decoder first introduced by Bravyi and Haah [Phys. Rev. Lett. 111, 200501 (2013)]. We study its performance when both the physical qudits and the syndromes measurements are subject to generalized uncorrelated bit-flip noise (and the higher dimensional equivalent). We show that, with appropriate enhancements to the decoder and a high enough qudit dimension, a threshold at an error rate of more than 8% can be achieved.
arXiv comment13 pages, 19 figures, authors' final copy
References in corpus (27)
- Fault-tolerant quantum computation by anyons
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological fault-tolerance in cluster state quantum computation
- 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
- Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Towards practical classical processing for the surface code
- Enhanced fault-tolerant quantum computing in -level systems
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Fault-tolerant thresholds for quantum error correction with the surface code
- Qutrit Magic State Distillation
- Architectural design for a topological cluster state quantum computer
- Efficient Decoders for Qudit Topological Codes
- Phase Structure of the Random-Plaquette Z_2 Gauge Model: Accuracy Threshold for a Toric Quantum Memory
- An efficient Markov chain Monte Carlo algorithm for the surface code
- Qudit surface codes and gauge theory with finite cyclic groups
- Quantum Control in the Cs 6S_{1/2} Ground Manifold Using rf and μw Magnetic Fields
- Kitaev's Z_d-Codes Threshold Estimates
- Error Thresholds for Abelian Quantum Double Models: Increasing the bit-flip Stability of Topological Quantum Memory
- Improved HDRG decoders for qudit and non-Abelian quantum error correction
- Logical Error Rate Scaling of the Toric Code
- A simple decoder for topological codes
Cited by in corpus (44)
- The XZZX Surface Code
- Almost-linear time decoding algorithm for topological codes
- Ultrahigh Error Threshold for Surface Codes with Biased Noise
- Native qudit entanglement in a trapped ion quantum processor
- Fault-tolerant error correction with the gauge color code
- Tensor-Network Simulations of the Surface Code under Realistic Noise
- A scheme for universal high-dimensional quantum computation with linear optics
- Pauli stabilizer models of twisted quantum doubles
- Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
- Decoding algorithms for surface codes
- Simulating 2D lattice gauge theories on a qudit quantum computer
- Efficient entanglement purification protocols for d-level systems
- Transversal Clifford gates on folded surface codes
- A scalable and fast artificial neural network syndrome decoder for surface codes
- Linear-time general decoding algorithm for the surface code
- Fault-Tolerant Quantum Error Correction for non-Abelian Anyons
- Qudit entanglers using quantum optimal control
- Empowering high-dimensional quantum computing by traversing the dual bosonic ladder
- General tensor network decoding of 2D Pauli codes
- Classical Simulation of Quantum Error Correction in a Fibonacci Anyon Code
- Parafermions in a Kagome lattice of qubits for topological quantum computation
- The role of entropy in topological quantum error correction
- Topological quantum error correction in the Kitaev honeycomb model
- Active error correction for Abelian and non-Abelian anyons
- A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing
- Preserving multi-level quantum coherence by dynamical decoupling
- Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
- A high threshold code for modular hardware with asymmetric noise
- Variational Quantum Multi-Objective Optimization
- Non-Pauli errors can be efficiently sampled in qudit surface codes
- Comparison of memory thresholds for planar qudit geometries
- Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases
- Generation of photonic tensor network states with Circuit QED
- Finite-Function-Encoding Quantum States
- Low Overhead Qutrit Magic State Distillation
- Unconditionally separating noisy from bounded polynomial threshold circuits of constant depth
- Qudit low-density parity-check codes
- Comparing Schemes for Creating Qudit Graph States from 16- & 128-dimensional Hilbert Space using Donors in Silicon
- Measurement-based quantum computing with qudit stabilizer states
- Topological stabilizer models on continuous variables
- Generalized XOR non-locality games with graph description on a square lattice
- Entanglement swapping for partially entangled qudits and the role of quantum complementarity
- Qudit Noisy Stabilizer Formalism
- Blind quantum computing with different qudit resource state architectures