Quantum game algorithms find equilibrium faster with matrix exponential method
Guiding Agents of Quantum Games to Equilibrium using Matrix Exponential Fixed-Point Iteration
Computer Science and Game TheoryMachine LearningMultiagent Systems
Summary
Finding stable strategies in quantum games is hard because of the huge combined space players’ choices occupy. The authors work with a special kind of quantum game where each player uses local quantum states. They develop a way to compute payoffs and their changes without building the full massive system, making calculations more manageable. Using this, they create a new algorithm that quickly finds equilibrium points and compares it with an existing method, showing better accuracy with fewer steps. This work helps make solving quantum decision problems more practical.
What this means in practice
- •For quantum algorithm developers: Implement faster equilibrium-finding routines for multi-agent quantum games using the matrix exponential fixed-point iteration approach.
- •For quantum system simulators: Simulate multi-agent quantum interactions more efficiently by avoiding full joint state constructions through tensor contractions in payoff calculations.
Authors
Alireza Habibi, Luis F. Abanto Leon, Setareh Maghsudi
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.