Introduces coherent swap regret against local CPTP maps and proves a three-level landscape where non-unital measurement-preparation channels force Theta(sqrt(d T log d)) minimax regret while unital channels have zero regret.
Parallel approximation of non-interactive zero-sum quantum games
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement on the two states to determine the players' payoffs. We prove that an equilibrium point of any such game can be approximated by means of an efficient parallel algorithm, which implies that one-turn quantum refereed games, wherein the referee is specified by a quantum circuit, can be simulated in polynomial space.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Coherent Swap Regret and Channel-Proof Learning
Introduces coherent swap regret against local CPTP maps and proves a three-level landscape where non-unital measurement-preparation channels force Theta(sqrt(d T log d)) minimax regret while unital channels have zero regret.