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

Alireza Habibi; Setareh Maghsudi

quant-phSep 7, 2026

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

Authors: Alireza Habibi, Setareh Maghsudi

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.

Explore similar work

May 14, 2026cs.LG

Quantum Advantage in Multi Agent Reinforcement Learning

We present an empirical evaluation of quantum entanglement in agent coordination within quantum multi agent reinforcement learning (QMARL). While QMARL has attracted growing interest recently, most prior work evaluates quantum policies without provable baselines, making it impossible to rigorously distinguish quantum advantage from algorithmic coincidence. We address this directly by evaluating a decentralized QMARL framework with variational quantum circuit (VQC) actors with shared entangled states. In the CHSH game, which has a mathematically proven classical performance ceiling of 0.75 win rate, we show that entangled QMARL agents approach the Tsirelson limit of 0.854, providing clear evidence of their quantum advantage. We show that unentangled quantum circuits match the classical baseline, confirming that entanglement and not the quantum circuit itself is the active coordination mechanism. We also explore the effect of specific entanglement structures, as some Bell states enable coordination gains while others actively harm performance. On cooperative navigation (CoopNav), QMARL without entanglement achieves

\sim2\times

improvement in success rate over classical MAA2C (

\sim

0.85 versus

\sim

0.40), with the hybrid configuration, quantum actor paired with a classical centralised critic, outperforming both fully classical and fully quantum solutions. We present our experimental analysis and discuss future work.

Simranjeet Singh Dahia, Claudia Szabo

Multi-Agent Reinforcement Learning Quantum Advantage Entanglement Variational Quantum Circuits

Ask PDF

Jun 1, 2026quant-ph

Coherent Swap Regret and Channel-Proof Learning

External regret certifies stability only against replacing one's behavior by a fixed alternative. In a quantum game, this misses a natural physical move: a player can apply a local completely positive trace-preserving (CPTP) map to the state it actually received or prepared. We introduce coherent swap regret as the regret benchmark against all such local CPTP deviations, and give an algorithm achieving

O(\sqrt{dT\log d})

coherent swap regret via entropic mirror ascent on the CPTP Choi slice with a fixed-point play rule. The main result is a three-level deviation-class landscape. Replacement channels recover ordinary external regret at rate

Θ(\sqrt{T\log d})

. Unital channels, including unitary deviations and mixtures of unitaries, have zero minimax regret. Deterministic measurement-and-preparation channels already force

Ω(\sqrt{dT\log d})

regret in the moderate-horizon regime, and this rate is also sufficient for all CPTP deviations. Thus the hardness comes from non-unital use of the recommendation register, not from quantum coherence alone. As an application, decentralized full-information learning in finite quantum games reaches an

\varepsilon

-approximate separable quantum correlated equilibrium after

T=O(\max_i d_i\log d_i/\varepsilon^2)

rounds. We identify these equilibria with channel-proofness of mediated quantum recommendation protocols, give an SDP audit for local CPTP exploitability applicable to arbitrary finite-dimensional states, and include a probing-bandit extension with pseudo-regret

O(d^{4/3}T^{2/3}(\log d)^{1/3})

under Haar-random pure-state probes.

Sohail Sarkar

Post-Quantum Cryptography O(T^Β)$ Simultaneous Regret Regret Privacy-Preserving Framework

Ask PDF

Jul 10, 2026quant-ph

When Routes Run Out: Adversarial Co-Learning and Explainable Robustness in Quantum Repeater Networks

We study an adversarial bandit problem for entanglement-based quantum-network routing over a modest graph corpus. Alice selects an end-to-end repeater route for an Ekert-91 protocol (E91) representing her move, while Eve selects an attack surface, either edge intercept--resend or repeater memory degradation. Payoffs are drawn from cached SeQUeNCe-simulated E91 transcripts, and Alice accepts a turn when the finite-sample statistic violates the Clauser-Horne-Shimony-Holt (CHSH) bound. Performing adversarial co-learning across 50 structured topologies, we find that learned retention tracks a full-matrix minimax reference closely (Pearson

r=0.99

): under a one-surface Eve action model, bottleneck families have zero retention, while non-bottleneck families follow a

1-1/N

coverage principle. We then fit decision-tree explanation models to graph-, attack-, and route-level topology-corpus targets and report their faithfulness. Finally, we construct prompt records for local language models to summarize the tree evidence, resulting in an open-source explanation workflow for quantum-repeater network games.

Brennan Bell, Inti Gabriel Mendoza Estrada, Andreas Trügler +1

Entanglement Adversarial Training Lane Topology

Ask PDF