IEEE International Conference on Quantum Computing and Engineering (QCE)
Graph Dilution for Decoding Surface Codes
Boqing Zhang, Siyuan Niu
Abstract
We present a low-complexity belief propagation (BP) decoding strategy for surface codes by dynamically diluting the decoding graphs based on both BP soft messages and the underlying topological product structure. Analytically, we show that the structural dilution breaks dominant short cycles of the decoding graphs while preserving the original distance of surface codes. Numerical results demonstrate that standard BP on these dynamically diluting graphs achieves a 9 % threshold under Pauli-X noise, closely matching the 9.1 % threshold of BP-OSD. Notably, the proposed soft decoder with almost linear complexity effectively solves the BP non-convergence issue under the code capacity noise model without introducing any postprocessing or heuristic adaptation, making it a highly promising candidate for efficient hardware implementation in real-time quantum decoding under circuit-level noise.