Resource-Efficient Decoding of Topological Color Codes via Neural-Guided Union-Find Optimization
Source abstract
Abstract
Quantum error correction (QEC) is crucial for achieving reliable quantum computation. Among topological QEC codes, color codes can correct bit-flip and phase-flip errors simultaneously, enabling efficient resource utilization. However, existing decoders such as the Union–Find (UF) algorithm exhibit limited accuracy under high noise levels. We propose a hybrid decoding framework that augments a modified UF algorithm—enhanced with a secondary growth strategy—with a lightweight recurrent neural network (RNN). The RNN refines the error chains identified by UF, improving resolution without significantly increasing computational overhead. The simulation results show that our method achieves notable accuracy gains over baseline UF decoding, particularly in high-error regimes, while preserving the near-linear runtime scaling and low memory footprint of UF. At higher physical error rates, RNN-based path optimization improves UF decoding accuracy by approximately 4.7%. The decoding threshold of the color code reaches 0.1365, representing an increase of about 2% compared to UF without RNN optimization. With its simple data structure and low space complexity, the proposed method is well suited for low-latency, resource-constrained quantum computing environments.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Quantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Information and Control Engineering, Qingdao University of Technology, Qingdao 266033, China
School of Science, Qingdao University of Technology, Qingdao 266033, China
Funding
Natural Science Foundation of Shandong Province · Joint Fund of the Natural Science Foundation of Shandong Province · Key R&D Program of Shandong Province
References (48)
Show source-provided references
1. Devitt, S.J., Munro, W.J., and Nemoto, K. (2013). Quantum error correction for beginners. Rep. Prog. Phys., 76.10.1088/0034-4885/76/7/076001 ↗
2. Quantum error correction: An introductory guide10.1080/00107514.2019.1667078 ↗
3. Quantum error correction for quantum memories10.1103/RevModPhys.87.307 ↗
4. Realization of quantum error correction10.1038/nature03074 ↗
5. Cory, D.G., Price, M.D., Maas, W., Knill, E., and Laflamme, R. (1998). Experimental Quantum Error Correction. Phys. Rev. Lett., 81.10.1103/PhysRevLett.81.2152 ↗
6. Knill, E., and Laflamme, R. (1997). Theory of quantum error-correcting codes. Phys. Rev. A, 55.10.1103/PhysRevA.55.900 ↗
7. Quantum error correction beyond qubits10.1038/nphys1309 ↗
8. Dür, W., Skotiniotis, M., Froewis, F., and Kraus, B. (2014). Improved Quantum Metrology Using Quantum Error Correction. Phys. Rev. Lett., 112.10.1103/PhysRevLett.112.080801 ↗
9. Kubica, A., Yoshida, B., and Pastawski, F. (2015). Unfolding the color code. New J. Phys., 17.10.1088/1367-2630/17/8/083026 ↗
10. Anwar, H., Brown, B.J., Campbell, E.T., and Browne, D.E. (2014). Fast decoders for qudit topological codes. New J. Phys., 16.10.1088/1367-2630/16/6/063038 ↗
11. Brown, B.J., Nickerson, N.H., and Browne, D.E. (2016). Fault-tolerant error correction with the gauge color code. Nat. Commun., 7.10.1038/ncomms12302 ↗
12. Wang, Y., Simsek, S., Gatterman, T.M., Gerber, J.A., Gilmore, K., Gresh, D., and Criger, B. (2024). Fault-tolerant one-bit addition with the smallest interesting color code. Sci. Adv., 10.10.1126/sciadv.ado9024 ↗
13. Kesselring, M.S., Pastawski, F., Eisert, J., and Brown, B.J. (2018). The boundaries and twist defects of the color code and their applications to topological quantum computation. Quantum, 2.10.22331/q-2018-10-19-101 ↗
14. Yoshida, B. (2015). Topological color code and symmetry-protected topological phases. Phys. Rev. B, 91.10.1103/PhysRevB.91.245131 ↗
15. Reichardt, B.W. (2020). Fault-tolerant quantum error correction for Steane’s seven-qubit color code with few or no extra qubits. Quantum Sci. Technol., 6.10.1088/2058-9565/abc6f4 ↗
16. San Miguel, J.F., Williamson, D.J., and Brown, B.J. (2023). A cellular automaton decoder for a noise-bias tailored color code. Quantum, 7.10.22331/q-2023-03-09-940 ↗
17. Baireuther, P., Caio, M.D., Criger, B., Beenakker, C.W., and O’Brien, T.E. (2019). Neural network decoder for topological color codes with circuit level noise. New J. Phys., 21.10.1088/1367-2630/aaf29e ↗
18. Patwary, M.M.A., Blair, J., and Manne, F. (2010). Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. International Symposium on Experimental Algorithms, Springer.10.1007/978-3-642-13193-6_35 ↗
19. Manne, F., and Patwary, M.M.A. (2010). A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers. Parallel Processing and Applied Mathematics, Springer.10.1007/978-3-642-14390-8_20 ↗
20. Practical parallel Union-Find algorithms for transitive closure and clustering10.1007/BF01383882 ↗
21. Wilkinson, M.H., and Roerdink, J.B. (2000). Fast Morphological Attribute Operations Using Tarjan’s Union-Find Algorithm. Mathematical Morphology and Its Applications to Image and Signal Processing, Springer.
22. Griffiths, S.J., and Browne, D.E. (2024). Union-find quantum decoding without union-find. Phys. Rev. Res., 6.10.1103/PhysRevResearch.6.013154 ↗
23. Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits10.1007/s10817-017-9431-7 ↗
24. A Lower Bound on the Complexity of the Union-Split-Find Problem10.1137/0217070 ↗
25. Vittal, S., Das, P., and Qureshi, M. (2023, January 17–21). Astrea: Accurate quantum error-decoding via practical minimum-weight perfect-matching. Proceedings of the 50th Annual International Symposium on Computer Architecture, Orlando, FL, USA.10.1145/3579371.3589037 ↗
26. A faster algorithm for minimum-cost bipartite perfect matching in planar graphs
27. Toward a Union-Find Decoder for Quantum LDPC Codes10.1109/TIT.2022.3143452 ↗
28. Computing minimum-weight perfect matchings10.1287/ijoc.11.2.138 ↗
29. Wu, Y., Liyanage, N., and Zhong, L. (1999). An interpretation of Union-Find Decoder on Weighted Graphs. arXiv.
30. Liyanage, N., Wu, Y., Tagare, S., and Zhong, L. (2024). FPGA-Based Distributed Union-Find Decoder for Surface Codes. IEEE Trans. Quantum Eng., 5.10.36227/techrxiv.171624125.57457222/v1 ↗
31. Chan, T., and Benjamin, S.C. (2023). Actis: A strictly local union–find decoder. Quantum, 7.10.22331/q-2023-11-14-1183 ↗
32. Wang, H.W., Xue, Y.J., Ma, Y.L., Hua, N., and Ma, H.Y. (2022). Determination of quantum toric error correction code threshold using convolutional neural network decoders. Chin. Phys. B, 31.10.1088/1674-1056/ac11e3 ↗
33. Löbl, M.C., Chen, S.X., Paesani, S., and Sørensen, A.S. (2024). Breadth-first graph traversal union-find decoder. arXiv.
34. Tian, Y., Zheng, Y., and Wang, X. (2024, January 1–3). High-performance and efficient decoding of surface codes: An iterative reweighted union-find approach. Proceedings of the Ninth International Symposium on Advances in Electrical, Electronics, and Computer Engineering, Changchun, China.10.1117/12.3034384 ↗
35. Das, P., Pattison, C.A., Manne, S., Carmean, D., Svore, K., Qureshi, M., and Delfosse, N. (2020). A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing. arXiv.
36. Wolanski, S., and Barber, B. (2024). Ambiguity Clustering: An accurate and efficient decoder for qLDPC codes. arXiv.10.1109/QCE60285.2024.10326 ↗
37. Connolly, N., Londe, V., Leverrier, A., and Delfosse, N. (2024). Fast erasure decoder for hypergraph product codes. Quantum, 8.10.22331/q-2024-08-27-1450 ↗
38. Egorov, E., Bondesan, R., and Welling, M. (2023). The END: An Equivariant Neural Decoder for Quantum Error Correction. arXiv.
39. Sherstinsky, A. (2020). Fundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) network. Phys. D Nonlinear Phenom., 404.10.1016/j.physd.2019.132306 ↗
40. Yin, W., Kann, K., Yu, M., and Schütze, H. (2017). Comparative Study of CNN and RNN for Natural Language Processing. arXiv.
41. Dhruv, P., and Naskar, S. (2024). Image Classification Using Convolutional Neural Network (CNN) and Recurrent Neural Network (RNN): A Review. Machine Learning and Information Processing, Springer.
42. LSTM: A Search Space Odyssey10.1109/TNNLS.2016.2582924 ↗
43. Li, F., Li, A.Q., Gan, Q.D., and Ma, H.Y. (2024). Recurrent neural network decoding of rotated surface codes based on distributed strategy. Chin. Phys. B, 33.10.1088/1674-1056/ad2bef ↗
44. Siami-Namini, S., Tavakoli, N., and Namin, A.S. (2019, January 9–12). The Performance of LSTM and BiLSTM in Forecasting Time Series. Proceedings of the 2019 IEEE International Conference on Big Data (Big Data), Los Angeles, CA, USA.10.1109/BigData47090.2019.9005997 ↗
45. Learning to Forget: Continual Prediction with LSTM10.1162/089976600300015015 ↗
46. Delfosse, N. (2014). Decoding color codes by projection onto surface codes. Phys. Rev. A, 89.10.1103/PhysRevA.89.012317 ↗
47. Delfosse, N., and Nickerson, N.H. (2021). Almost-linear time decoding algorithm for topological codes. Quantum, 5.10.22331/q-2021-12-02-595 ↗
48. Google Quantum AI and Collaborators (2025). Quantum error correction below the surface code threshold. Nature, 638, 920–926.10.1038/s41586-024-08449-y ↗