Guiding Agents of Quantum Games to Equilibrium using Matrix Exponential Fixed-Point Iteration
Abstract
In recent years, quantum game theory has gained significant attention as a framework for studying decision-making in multi-agent systems using quantum principles. However, computing equilibrium strategies is challenging because the dimension of the joint Hilbert space grows as the product of the players' local dimensions. In this paper, we consider an extended Gutoski-Watrous (EGW) game in which each player's quantum strategy is represented by a local density matrix. We derive tensor-contraction expressions for the payoff functions and their gradients, thereby avoiding the explicit construction of the full joint density matrix and its computationally expensive multiplication by the payoff operators. Building on the resulting effective Hamiltonians, we propose the Matrix Exponential Fixed-Point Iteration with Annealing (MEFPIA) algorithm to search for equilibrium points in EGW games. We compare MEFPIA with the Matrix Multiplicative Weights Update (MMWU) algorithm in terms of convergence. For the tested instances and parameter settings, both algorithms approach the same strategy profiles and payoffs, while MEFPIA achieves lower relative error in fewer iterations. These results indicate that MEFPIA is a promising numerical method for equilibrium search in multi-agent quantum games. Our findings provide important insights into the quantum game theory's potential for addressing complex decision-making processes, as well as opening up new paths for future research and exploration in multi-agent quantum systems.
Related
- DefectSkills: Guiding AI agents through first-principles calculations for point defects in semiconductors and insulators
- Guiding center quantization of a quantum Hall analog of Hawking radiation
- Simultaneously achieving Heisenberg- and Landau-limited precision in equilibrium quantum thermometry
- Exponential advantage in continuous-variable quantum state learning
- Random layers for quantum optimal control with exponential expressivity
BibTeX
@misc{habibi2026guiding,
title = {{Guiding Agents of Quantum Games to Equilibrium using Matrix Exponential Fixed-Point Iteration}},
author = {Alireza Habibi and Luis F. Abanto Leon and Setareh Maghsudi},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.21944},
eprint = {2609.21944},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.21944},
}
RIS
TY - UNPB
TI - Guiding Agents of Quantum Games to Equilibrium using Matrix Exponential Fixed-Point Iteration
AU - Alireza Habibi
AU - Luis F. Abanto Leon
AU - Setareh Maghsudi
PY - 2026
DA - 2026/09/18
PB - arXiv
DO - 10.48550/arxiv.2609.21944
UR - https://arxiv.org/abs/2609.21944
AB - In recent years, quantum game theory has gained significant attention as a framework for studying decision-making in multi-agent systems using quantum principles. However, computing equilibrium strategies is challenging because the dimension of the joint Hilbert space grows as the product of the players' local dimensions. In this paper, we consider an extended Gutoski-Watrous (EGW) game in which each player's quantum strategy is represented by a local density matrix. We derive tensor-contraction expressions for the payoff functions and their gradients, thereby avoiding the explicit construction of the full joint density matrix and its computationally expensive multiplication by the payoff operators. Building on the resulting effective Hamiltonians, we propose the Matrix Exponential Fixed-Point Iteration with Annealing (MEFPIA) algorithm to search for equilibrium points in EGW games. We compare MEFPIA with the Matrix Multiplicative Weights Update (MMWU) algorithm in terms of convergence. For the tested instances and parameter settings, both algorithms approach the same strategy profiles and payoffs, while MEFPIA achieves lower relative error in fewer iterations. These results indicate that MEFPIA is a promising numerical method for equilibrium search in multi-agent quantum games. Our findings provide important insights into the quantum game theory's potential for addressing complex decision-making processes, as well as opening up new paths for future research and exploration in multi-agent quantum systems.
ER -