Error-rate-agnostic decoding of topological stabilizer codes

Abstract

Efficient high-performance decoding of topological stabilizer codes has the potential to crucially improve the balance between logical failure rates and the number and individual error rates of the constituent qubits. High-threshold maximum-likelihood decoders require an explicit error model for Pauli errors to decode a specific syndrome, whereas lower-threshold heuristic approaches such as minimum weight matching are "error agnostic". Here we consider an intermediate approach, formulating a decoder that depends on the bias, i.e., the relative probability of phase-flip to bit-flip errors, but is agnostic to error rate. Our decoder is based on counting the number and effective weight of the most likely error chains in each equivalence class of a given syndrome. We use Metropolis-based Monte Carlo sampling to explore the space of error chains and find unique chains, that are efficiently identified using a hash table. Using the error-rate invariance the decoder can sample chains effectively at an error rate which is higher than the physical error rate and without the need for "thermalization" between chains in different equivalence classes. Applied to the surface code and the XZZX code, the decoder matches maximum-likelihood decoders for moderate code sizes or low error rates. We anticipate that, because of the compressed information content per syndrome, it can be taken full advantage of in combination with machine-learning methods to extrapolate Monte Carlo-generated data.

arXiv comment15 pages, 9 figures; V2 Added analysis of low error-rate performance

References in corpus (57)

• Fault-tolerant quantum computation by anyons
• Mixed State Entanglement and Quantum Error Correction
• Surface codes: Towards practical large-scale quantum computation
• Solving the Quantum Many-Body Problem with Artificial Neural Networks
• Topological quantum memory
• Machine learning phases of matter
• Quantum Error Correction for Quantum Memories
• Parallel Tempering: Theory, Applications, and New Perspectives
• State preservation by repetitive error detection in a superconducting quantum circuit
• Fault-tolerant quantum computation with high threshold in two dimensions
• Learning phase transitions by confusion
• Quantum orders in an exact soluble model
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Repeated Quantum Error Detection in a Surface Code
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• Low-distance Surface Codes under Realistic Quantum Noise
• The XZZX Surface Code
• Fast Decoders for Topological Quantum Codes
• Experimental demonstration of fault-tolerant state preparation with superconducting qubits
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Towards practical classical processing for the surface code
• A Neural Decoder for Topological Codes
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Optimizing Quantum Error Correction Codes with Reinforcement Learning
• Thresholds for topological codes in the presence of loss
• Strong Resilience of Topological Codes to Depolarization
• Machine Learning for Quantum Matter
• Machine-learning-assisted correction of correlated qubit errors in a topological code
• Logical-qubit operations in an error-detecting surface code
• Entangling logical qubits with lattice surgery
• Fault-tolerant thresholds for quantum error correction with the surface code
• Tailoring surface codes for highly biased noise
• Decoding Small Surface Codes with Feedforward Neural Networks
• Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
• Deep Neural Network Probabilistic Decoder for Stabilizer Codes
• High threshold error correction for the surface code
• Coping with qubit leakage in topological codes
• Density-matrix simulation of small surface codes under current and projected experimental noise
• Quantum error correction for the toric code using deep reinforcement learning
• Error Correction and Degeneracy in Surface Codes Suffering Loss
• Deep neural decoders for near term fault-tolerant experiments
• An efficient Markov chain Monte Carlo algorithm for the surface code
• Reinforcement Learning Decoders for Fault-Tolerant Quantum Computation
• Cellular-automaton decoders with provable thresholds for topological codes
• Cellular-automaton decoders for topological quantum memories
• Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
• Simulation of rare events in quantum error correction
• Scalable Neural Network Decoders for Higher Dimensional Quantum Codes
• Multi-path Summation for Decoding 2D Topological Codes
• Reinforcement learning for optimal error correction of toric codes
• Neural Network Decoders for Large-Distance 2D Toric Codes
• Deep Q-learning decoder for depolarizing noise on the toric code
• The Capabilities of a Perturbed Toric Code as a Quantum Memory
• Stability of topologically-protected quantum computing proposals as seen through spin glasses
• A NEAT Quantum Error Decoder

Cited by in corpus (5)

• A local pre-decoder to reduce the bandwidth and latency of quantum error correction
• The XYZ${}^2$ hexagonal stabilizer code
• Data-driven decoding of quantum error correcting codes using graph neural networks
• Exact results on finite size corrections for surface codes tailored to biased noise
• Simulated-annealing decoder for the XZZX code with greedy-matching initialization