Sciweavers

COCO
2009
Springer

Parallel Approximation of Non-interactive Zero-sum Quantum Games

14 years 4 months ago
Parallel Approximation of Non-interactive Zero-sum Quantum Games
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.
Rahul Jain, John Watrous
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where COCO
Authors Rahul Jain, John Watrous
Comments (0)