Riemannian Optimization for Multi-Player Quantum Games on Product Unitary Manifolds

• URL: http://arxiv.org/abs/2609.07397v1
• Date: Mon, 07 Sep 2026 12:10:00 GMT
• Title: Riemannian Optimization for Multi-Player Quantum Games on Product Unitary Manifolds
• Abstract summary: Quantum game theory is an extension of classical game theory that uses quantum principles in game theory.<n>In this paper, we first discuss the Extended EWL (EEWL) for multiplayer quantum games with mixed strategies.<n>We propose a geometry-aware sequential algorithm for the EEWL mixed-strategy setting, in which each player jointly learns a trainable set of local unitary actions.
• Score: 9.51084845180104
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum game theory is an extension of classical game theory that uses quantum principles in game theory. The Eisert-Wilkens-Lewenstein (EWL) quantum game is an early example of the two-player classical Prisoner's Dilemma transformed into a quantum Prisoner's Dilemma. In the EWL game, the players choose pure quantum strategies represented by unitary matrices. This extension can resolve the classical dilemma by enabling cooperative equilibrium with higher payoff. In this paper, we first discuss the Extended EWL (EEWL) for multiplayer quantum games with mixed strategies. In EEWL, each player controls a set of unitary operators as quantum actions and uses a classical mixed strategy over these actions. The payoffs are defined as expectation values of Hermitian reward operators acting on a shared quantum state, which is generated and measured according to the EEWL protocol. We then propose the Unitary Strategy Matrix Exponential Algorithm (USMEA), a geometry-aware sequential algorithm for the EEWL mixed-strategy setting, in which each player jointly learns a trainable set of local unitary actions and the associated classical mixing probabilities. Thereby it acts as a learning-and-control layer for multi-agent quantum decision systems. We analyze the convergence properties of USMEA under standard smoothness and step-size conditions and validate the theory with numerical experiments. These results show how classical optimization methods can be systematically integrated into the design and analysis of engineered quantum strategic interactions.

Related papers

• Quantum non-local games: Quantum relations, projection lattices and rule operators [51.56484100374058]
  (mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.
  arXiv  Detail & Related papers  (2026-08-31T09:41:14Z)
• Emergence of Strategic Equilibria from Transverse Field Ising Hamiltonian Dynamics [0.3580891736370874]
  We study quantum games using an operator-based formulation derived from the transverse-field quantum Ising model.<n>We show that the Hamiltonian-driven dynamics naturally generate entangling operator which resolve the dilemma in the game settings.
  arXiv  Detail & Related papers  (2026-08-30T17:41:19Z)
• Learnable yet not simulable: a quantum resource theory of learning models [57.695822250391906]
  It remains unclear which quantum resource governs the classical learnability of quantum circuits.<n>We study the expectation-value functions of families of tunable quantum circuits.<n>These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning.
  arXiv  Detail & Related papers  (2026-08-03T14:48:03Z)
• Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality [107.84586711462556]
  We show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits.<n>Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
  arXiv  Detail & Related papers  (2025-12-01T23:54:32Z)
• Entanglement as a Strategic Resource in Adversarial Quantum Games [0.0]
  Quantum game theory naturally extends classical strategic decision-making by leveraging quantum superposition, entanglement, and measurement-based pay offs.<n>This paper introduces a novel team-based Quantum Sabotage Game (QSG), where two competing teams, one classical and one quantum-enhanced, engage in adversarial strategies.
  arXiv  Detail & Related papers  (2025-10-25T22:05:11Z)
• QEGS: A Mathematica Package for the Analysis of Quantum Extended Games [0.0]
  Quantum games have attracted much attention in recent years due to their ability to solve decision-making dilemmas.<n>This study introduces a Mathematica package dedicated to the study of quantum extensions of classical $2times2$ games based on the EWL scheme.
  arXiv  Detail & Related papers  (2025-04-16T11:43:01Z)
• A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [95.50895904060309]
  We introduce the Optimistic Matrix Multiplicative Weights Update (OMMWU) algorithm and establish its average-iterate convergence complexity as $mathcalO(d/epsilon)$ to $epsilon$-Nash equilibria.<n>This quadratic speed-up sets a new benchmark for computing $epsilon$-Nash equilibria in quantum zero-sum games.
  arXiv  Detail & Related papers  (2023-11-17T20:38:38Z)
• Photonic implementation of the quantum Morra game [69.65384453064829]
  We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case. We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game. We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
  arXiv  Detail & Related papers  (2023-11-14T19:41:50Z)
• Learning in Quantum Common-Interest Games and the Separability Problem [29.768913836823973]
  We introduce quantum common-interest games (CIGs) where players have density matrices as strategies and their interests are perfectly aligned.<n>We bridge the gap between optimization and game theory by establishing the equivalence between KKT (first-order stationary) points of an instance of the Best Separable State (BSS) problem and the Nash equilibria of its corresponding quantum CIG.<n>Taking the perspective of learning in games, we then introduce non-commutative extensions of the continuous-time replicator dynamics and the discrete-time best response dynamics/linear multiplicative weights update for learning in quantum
  arXiv  Detail & Related papers  (2023-02-09T17:27:32Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.