Phys. Rev. A 67, 022311 (2003) [5 pages]Efficiency and formalism of quantum gamesReceived 2 August 2002; published 28 February 2003 We show that quantum games are more efficient than classical games and provide a saturated upper bound for this efficiency. We also demonstrate that the set of finite classical games is a strict subset of the set of finite quantum games. Our analysis is based on a rigorous formulation of quantum games, from which quantum versions of the minimax theorem and the Nash equilibrium theorem can be deduced. © 2003 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.67.022311
DOI:
10.1103/PhysRevA.67.022311
PACS:
03.67.-a, 02.50.Le
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.