Spanning Tree Matching Decoder for Quantum Surface Codes
IEEE Communications Letters(2024)
摘要
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.
更多查看译文
关键词
Quantum Error Correcting Codes,Quantum Communications,Quantum Computing,Surface Codes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要