Please use this identifier to cite or link to this item:
|Title:||Parallel approximation of non-interactive zero-sum quantum games|
|Authors:||Jain, R. |
|Citation:||Jain, R., Watrous, J. (2009). Parallel approximation of non-interactive zero-sum quantum games. Proceedings of the Annual IEEE Conference on Computational Complexity : 243-253. ScholarBank@NUS Repository. https://doi.org/10.1109/CCC.2009.26|
|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. © 2009 IEEE.|
|Source Title:||Proceedings of the Annual IEEE Conference on Computational Complexity|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 11, 2018
WEB OF SCIENCETM
checked on Jul 17, 2018
checked on Jul 7, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.