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.
|Original language||English (US)|
|Number of pages||1|
|Journal||Physical Review A - Atomic, Molecular, and Optical Physics|
|State||Published - Jan 1 2003|
ASJC Scopus subject areas
- Atomic and Molecular Physics, and Optics