Spanning Tree Matching Decoder for Quantum Surface Codes
arXiv:2405.01151 · doi:10.1109/LCOMM.2024.3396882
Abstract
We introduce the spanning tree matching (STM) decoder for surface codes, which guarantees the error correction capability up to the code's designed distance by first employing an instance of the minimum spanning tree on a subset of ancilla qubits within the lattice. Then, a perfect matching graph is simply obtained, by selecting the edges more likely to be faulty. A comparative analysis reveals that the STM decoder, at the cost of a slight performance degradation, provides a substantial advantage in decoding time compared to the minimum weight perfect matching (MWPM) decoder. Finally, we propose an even more simplified and faster algorithm, the Rapid-Fire (RFire) decoder, designed for scenarios where decoding speed is a critical requirement.
arXiv commentTo be published in IEEE Communications Letters
References in corpus (14)
- Quantum Computing in the NISQ era and beyond
- Quantum Error Correction for Quantum Memories
- Logical quantum processor based on reconfigurable atom arrays
- Quantum codes on a lattice with boundary
- When Entanglement meets Classical Communications: Quantum Teleportation for the Quantum Internet (Invited Paper)
- Almost-linear time decoding algorithm for topological codes
- An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
- Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
- Improved decoding of circuit noise and fragile boundaries of tailored surface codes
- Parallel window decoding enables scalable fault tolerant quantum computation
- Decoding algorithms for surface codes
- A scalable and fast artificial neural network syndrome decoder for surface codes
- Improving the speed of variational quantum algorithms for quantum error correction
- Minimum weight perfect matching of fault-tolerant topological quantum error correction in average parallel time