Export citation

Export citation

Choose format for download:

Download Citation
  • Access by Xinjiang University

Game-theoretic discovery of quantum error-correcting codes through Nash equilibria

Rubén Darío Guerrero*

  • *Contact author: rudaguerman@gmail.com

Phys. Rev. A 114, 012465 – Published 28 July, 2026

DOI: https://doi.org/10.1103/x1ph-v78g

Abstract

Quantum error-correction code discovery has relied on algebraic constructions with predetermined structure or computational search lacking equilibrium-topology analysis. We introduce a game-theoretic framework recasting code optimization as strategic interactions between competing objectives, where Nash equilibria systematically generate codes with desired properties. We validate the framework by demonstrating it rediscovers the optimal [[15,7,3]] quantum Hamming code in 20% of independent runs [A. R. Calderbank and P. W. Shor, Phys. Rev. A 54, 1098 (1996); A. Steane, Proc. R. Soc. Lond., Ser. A 452, 2551 (1996)] from competing objectives without predetermined algebraic structure, with equilibrium analysis providing transparent mechanistic insights into why this topology emerges. Applied across seven objectives [distance maximization, hardware adaptation, rate-distance optimization, cluster-state generation, surfacelike topologies, connectivity enhancement, and maximization of the quantum Fisher information (which quantifies, via the Cramér-Rao bound, the metrological sensitivity of the encoded codespace)], the framework generates distinct code families through objective reconfiguration rather than algorithm redesign. Scalability to hardware-relevant sizes is demonstrated at n=100 qubits, discovering codes including [[100,50,4]] with distance-4 protection and 50% encoding rate, with tractable cubic per-iteration complexity enabling discovery in under 1 h. This work opens research avenues at the intersection of game theory and quantum information, providing systematic, interpretable frameworks for quantum system design.

Physics Subject Headings (PhySH)

Article Text

References (41)

  1. P. Panteleev and G. Kalachev, Asymptotically good quantum and linear LDPC codes from fiber bundles, in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (ACM, New York, 2022), pp. 375–388.
  2. A. Leverrier and G. Zémor, Quantum Tanner codes, Quantum 6, 766 (2022).
  3. S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Roushan, and T. J. Yoder, High-threshold and low-overhead fault-tolerant quantum memory, Nature (London) 627, 778 (2024).
  4. D. Bluvstein et al., Logical quantum processor based on reconfigurable atom arrays, Nature (London) 626, 58 (2024).
  5. B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys. 87, 307 (2015).
  6. D. Gottesman, Stabilizer codes and quantum error correction, Ph.D. thesis, Caltech, 1997.
  7. A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54, 1098 (1996).
  8. A. Steane, Multiple-particle interference and quantum error correction, Proc. R. Soc. Lond., Ser. A 452, 2551 (1996).
  9. A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Phys. 303, 2 (2003).
  10. M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, http://codetables.de.
  11. H. P. Nautrup et al., Optimizing quantum error correction codes with reinforcement learning, Quantum 3, 215 (2019).
  12. T. Fosel, P. Tighineanu, T. Weiss, and F. Marquardt, Reinforcement learning with neural networks for quantum feedback, Phys. Rev. X 8, 031084 (2018).
  13. G. Torlai and R. G. Melko, Neural-network quantum state tomography, Phys. Rev. Lett. 120, 240503 (2018).
  14. J. Nash, Equilibrium points in n-person games, Proc. Natl. Acad. Sci. USA 36, 48 (1950).
  15. M. J. Osborne and A. Rubinstein, A Course in Game Theory (MIT Press, Cambridge, 1994).
  16. J. Eisert, M. Wilkens, and M. Lewenstein, Quantum games and quantum strategies, Phys. Rev. Lett. 83, 3077 (1999).
  17. D. A. Meyer, Quantum strategies, Phys. Rev. Lett. 82, 1052 (1999).
  18. A. B. Khesin, J. Z. Lu, and P. W. Shor, Universal graph representation of stabilizer codes, PRX Quantum 6, 040325 (2025).
  19. P. Webster, M. Vasmer, T. R. Scruby, and S. D. Bartlett, Transversal gates and error propagation in fault-tolerant quantum error correction, Phys. Rev. Res. 4, 013092 (2022).
  20. M. Hein, J. Eisert, and H. J. Briegel, Multiparty entanglement in graph states, Phys. Rev. A 69, 062311 (2004).
  21. M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Van den Nest, and H. J. Briegel, Entanglement in graph states and its applications, in Quantum Computers, Algorithms and Chaos, edited by G. Casati et al., Proceedings of the International School of Physics “Enrico Fermi” Vol. 162 (IOS Press, Amsterdam, 2006), pp. 115–218.
  22. R. Raussendorf and H. J. Briegel, A one-way quantum computer, Phys. Rev. Lett. 86, 5188 (2001).
  23. S. Perdrix, State transfer instead of teleportation in measurement-based quantum computation, in Proceedings of the 3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006), Lecture Notes in Compuer Science (Springer, Berlin, 2006), Vol. 3959, pp. 307–318.
  24. D. Schlingemann and R. F. Werner, Quantum error-correcting codes associated with graphs, Phys. Rev. A 65, 012308 (2001).
  25. N. Raveendran, N. Rengaswamy, F. Rozpędek, A. Raina, L. Jiang, and B. Vasić, Soft information decoding of quantum LDPC codes, Quantum 6, 767 (2022).
  26. D. Monderer and L. S. Shapley, Potential games, Games Econ. Behav. 14, 124 (1996).
  27. C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou, The complexity of computing a Nash equilibrium, SIAM J. Comput. 39, 195 (2009).
  28. E. Knill and R. Laflamme, Theory of quantum error-correcting codes, Phys. Rev. A 55, 900 (1997).
  29. M. Van den Nest, J. Dehaene, and B. De Moor, Graphical description of the action of local Clifford transformations on graph states, Phys. Rev. A 69, 022316 (2004).
  30. Google Quantum AI and Collaborators, Quantum error correction below the surface code threshold, Nature (London) 638, 920 (2025).
  31. S. L. Braunstein and C. M. Caves, Statistical distance and the geometry of quantum states, Phys. Rev. Lett. 72, 3439 (1994).
  32. M. G. A. Paris, Quantum estimation for quantum technology, Int. J. Quantum Inf. 07, 125 (2009).
  33. E. M. Kessler, I. Lovchinsky, A. O. Sushkov, and M. D. Lukin, Quantum error correction for metrology, Phys. Rev. Lett. 112, 150802 (2014).
  34. K.-Y. Kuo and C.-Y. Lai, Exploiting degeneracy in belief propagation decoding of quantum codes, npj Quantum Inf. 8, 111 (2022).
  35. C. Chamberland et al., Building a fault-tolerant quantum computer using concatenated cat codes, PRX Quantum 3, 010329 (2022).
  36. O. Hart, D. T. Stephen, D. J. Williamson, M. Foss-Feig, and R. Nandkishore, Playing nonlocal games across quantum phase transitions, Phys. Rev. Lett. 134, 130602 (2025).
  37. B. Eastin and E. Knill, Restrictions on transversal encoded quantum gate sets, Phys. Rev. Lett. 102, 110502 (2009).
  38. D. K. Tuckett, S. D. Bartlett, and S. T. Flammia, Ultrahigh error threshold for surface codes with biased noise, Phys. Rev. Lett. 120, 050505 (2018).
  39. R. Sweke, M. S. Kesselring, E. P. L. van Nieuwenburg, and J. Eisert, Reinforcement learning decoders for fault-tolerant quantum computation, Mach. Learn.: Sci. Technol. 2, 025005 (2021).
  40. D. Fitzek, M. Eliasson, A. F. Kockum, and M. Granath, Deep Q-learning decoder for depolarizing noise on the toric code, Phys. Rev. Res. 2, 023230 (2020).
  41. J. Ollé, D. Müller-Hermes, and T. Müller, Simultaneous discovery of quantum error correction codes and encoders with a noise-aware reinforcement learning agent, npj Quantum Inf. 10, 98 (2024).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation