.png){kind=icon}
Return
Spanning Tree Matching Decoder for Quantum Surface Codes
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2024.3396882.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Decoding
Codes
Qubit
Lattices
Error correction
Pattern matching
Error correction codes
Quantum error correcting codes
quantum communications
quantum computing
surface codes
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
No cited papers available