Parallel approximation of non-interactive zero-sum quantum games

Simple item page
dc.creatorJain, Rahul
dc.creatorWatrous, John
dc.date2008-08-20
dc.date.accessioned2026-07-07T09:57:32Z
dc.date.available2026-07-07T09:57:32Z
dc.descriptionThis 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.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/0808.2775
dc.identifierhttp://arxiv.org/abs/0808.2775
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/167374
dc.subjectQuantum Physics
dc.titleParallel approximation of non-interactive zero-sum quantum games
dc.typetext

Files

Collections

arXiv