Progressive-Proximity Bit-Flipping for Decoding Surface Codes

Abstract

Topological quantum codes, such as toric and surface codes, are excellent candidates for hardware implementation due to their robustness against errors and their local interactions between qubits. However, decoding these codes efficiently remains a challenge: existing decoders often fall short of meeting requirements such as having low computational complexity (ideally linear in the code's blocklength), low decoding latency, and low power consumption. In this paper we propose a novel bit-flipping (BF) decoder tailored for toric and surface codes. We introduce the proximity vector as a heuristic metric for flipping bits, and we develop a new subroutine for correcting degenerate multiple errors on adjacent qubits. Our algorithm has quadratic complexity growth and it can be efficiently implemented as it does not require operations on dynamic memories, as do state-of-art decoding algorithms such as minimum weight perfect matching or union find. The proposed decoder shows a decoding threshold of 7.5% for the 2D toric code and 7% for the rotated planar code over the binary symmetric channel.

arXiv comment11 pages, 8 figures

References in corpus (12)

• Good Quantum Error-Correcting Codes Exist
• Topological quantum memory
• Surface code quantum computing by lattice surgery
• Sparse Graph Codes for Quantum Error-Correction
• Fast Decoders for Topological Quantum Codes
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• Cellular-automaton decoders for topological quantum memories
• Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
• A scalable and fast artificial neural network syndrome decoder for surface codes
• Spanning Tree Matching Decoder for Quantum Surface Codes