Efficiency and formalism of quantum games

Chiu Fan Lee, Neil Johnson

Published 2002-07-02, updated 2008-09-19Version 4

We pursue a general theory of quantum games. We show that quantum games are more efficient than classical games, and provide a saturated upper bound for this efficiency. We demonstrate that the set of finite classical games is a strict subset of the set of finite quantum games. We also deduce the quantum version of the Minimax Theorem and the Nash Equilibrium Theorem.