Progressive-Proximity Bit-Flipping for Decoding Surface Codes
<|reference_start|>Progressive-Proximity Bit-Flipping for Decoding Surface Codes: 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.<|reference_end|>
@article{pacenti2024progressive-proximity,
    title={Progressive-Proximity Bit-Flipping for Decoding Surface Codes},
    author={Michele Pacenti, Mark F. Flanagan, Dimitris Chytas, Bane Vasic},
    journal={IEEE Transactions on Communications (2024)},
    year={2024},
    doi={10.1109/TCOMM.2024.3454029},
    archivePrefix={arXiv},
    eprint={2402.15924},
    primaryClass={quant-ph cs.IT math.IT}
}