中国物理B ›› 2025, Vol. 34 ›› Issue (5): 50311-050311.doi: 10.1088/1674-1056/adcb26
所属专题: SPECIAL TOPIC — Computational programs in complex systems
Dongyang Feng(冯东阳)1,2,3,†, Hanyan Cao(曹涵彦)2,3,†, and Pan Zhang(张潘)1,2,‡
Dongyang Feng(冯东阳)1,2,3,†, Hanyan Cao(曹涵彦)2,3,†, and Pan Zhang(张潘)1,2,‡
摘要: Quantum error correction is essential for realizing fault-tolerant quantum computing, where both the efficiency and accuracy of the decoding algorithms play critical roles. In this work, we introduce the implementation of the Planar algorithm, a software framework designed for fast and exact decoding of quantum codes with a planar structure. The algorithm first converts the optimal decoding of quantum codes into a partition function computation problem of an Ising spin glass model. Then it utilizes the exact Kac-Ward formula to solve it. In this way, Planar offers the exact maximum likelihood decoding in polynomial complexity for quantum codes with a planar structure, including the surface code with independent code-capacity noise and the quantum repetition code with circuit-level noise. Unlike traditional minimum-weight decoders such as minimum-weight perfect matching (MWPM), Planar achieves theoretically optimal performance while maintaining polynomial-time efficiency. In addition, to demonstrate its capabilities, we exemplify the implementation using the rotated surface code, a commonly used quantum error correction code with a planar structure, and show that Planar achieves a threshold of approximately $ p_{\rm uc} \approx 0.109 $ under the depolarizing error model, with a time complexity scaling of $ O(N^{0.69}) $, where $ N $ is the number of spins in the Ising model.
中图分类号: (Quantum error correction and other methods for protection against decoherence)