Efficient Syndrome Decoder for Heavy Hexagonal QECC via Machine Learning
arXiv:2210.09730 · doi:10.1145/3636516
Abstract
Error syndromes for heavy hexagonal code and other topological codes such as surface code have typically been decoded by using Minimum Weight Perfect Matching (MWPM) based methods. Recent advances have shown that topological codes can be efficiently decoded by deploying machine learning (ML) techniques, in particular with neural networks. In this work, we first propose an ML based decoder for heavy hexagonal code and establish its efficiency in terms of the values of threshold and pseudo-threshold, for various noise models. We show that the proposed ML based decoding method achieves higher values of threshold than that for MWPM. Next, exploiting the property of subsystem codes, we define gauge equivalence for heavy hexagonal code, by which two distinct errors can belong to the same error class. A linear search based method is proposed for determining the equivalent error classes. This provides a quadratic reduction in the number of error classes to be considered for both bit flip and phase flip errors, and thus a further improvement of in the threshold over the basic ML decoder. Lastly, a novel technique based on rank to determine the equivalent error classes is presented, which is empirically faster than the one based on linear search.
arXiv commentThis paper is published in ACM Transactions on Quantum Computing. Link https://dl.acm.org/doi/abs/10.1145/3636516
References in corpus (20)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Topological quantum memory
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- High threshold universal quantum computation on the surface code
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Quantum speedup of Monte Carlo methods
- Almost-linear time decoding algorithm for topological codes
- 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
- Machine-learning-assisted correction of correlated qubit errors in a topological code
- Decoding Small Surface Codes with Feedforward Neural Networks
- Deep Neural Network Probabilistic Decoder for Stabilizer Codes
- High threshold error correction for the surface code
- Deep neural decoders for near term fault-tolerant experiments
- Comparing neural network based decoders for the surface code
- Reinforcement Learning Decoders for Fault-Tolerant Quantum Computation
- Surface Code Design for Asymmetric Error Channels
- An interpretation of Union-Find Decoder on Weighted Graphs