Neural ensemble decoding for topological quantum error-correcting codes
arXiv:1905.02345 · doi:10.1103/PhysRevA.101.032338
Abstract
Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been proposed that achieve approximately optimal error thresholds. Due to practical constraints, it is not known if there exists an obvious choice for a decoder. In this paper, we introduce a framework which can combine arbitrary decoders for any given code to significantly reduce the logical error rates. We rely on the crucial observation that two different decoding techniques, while possibly having similar logical error rates, can perform differently on the same error syndrome. We use machine learning techniques to assign a given error syndrome to the decoder which is likely to decode it correctly. We apply our framework to an ensemble of Minimum-Weight Perfect Matching (MWPM) and Hard-Decision Re-normalization Group (HDRG) decoders for the surface code in the depolarizing noise model. Our simulations show an improvement of 38.4%, 14.6%, and 7.1% over the pseudo-threshold of MWPM in the instance of distance 5, 7, and 9 codes, respectively. Lastly, we discuss the advantages and limitations of our framework and applicability to other error-correcting codes. Our framework can provide a significant boost to error correction by combining the strengths of various decoders. In particular, it may allow for combining very fast decoders with moderate error-correcting capability to create a very fast ensemble decoder with high error-correcting capability.
arXiv commentReplaced with the published version, comments welcome!
References in corpus (21)
- Adam: A Method for Stochastic Optimization
- Fault-tolerant quantum computation by anyons
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Mechanics helps in searching for a needle in a haystack
- Surface codes: Towards practical large-scale quantum computation
- Good Quantum Error-Correcting Codes Exist
- Topological quantum memory
- Topological Quantum Distillation
- Grover's quantum searching algorithm is optimal
- Fast Decoders for Topological Quantum Codes
- Almost-linear time decoding algorithm for topological codes
- A Neural Decoder for Topological Codes
- Machine-learning-assisted correction of correlated qubit errors in a topological code
- Optimal and Efficient Decoding of Concatenated Quantum Block Codes
- High threshold error correction for the surface code
- Deep neural decoders for near term fault-tolerant experiments
- Advantages of versatile neural-network decoding for topological codes
- Comparing neural network based decoders for the surface code
- Neural network decoder for topological color codes with circuit level noise
- Linear-time general decoding algorithm for the surface code
- Comparison of memory thresholds for planar qudit geometries
Cited by in corpus (9)
- A scalable and fast artificial neural network syndrome decoder for surface codes
- Techniques for combining fast local decoders with global decoders under circuit-level noise
- Determination of the Semion Code Threshold using Neural Decoders
- Convolutional neural network based decoders for surface codes
- A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing
- Neural network decoder for near-term surface-code experiments
- Actis: A Strictly Local Union-Find Decoder
- Efficient diagnostics for quantum error correction
- Simulation of the five-qubit quantum error correction code on superconducting qubits