Efficiency and formalism of quantum games
Quantum Physics
2008-09-19 v4
Abstract
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.
Keywords
Cite
@article{arxiv.quant-ph/0207012,
title = {Efficiency and formalism of quantum games},
author = {Chiu Fan Lee and Neil Johnson},
journal= {arXiv preprint arXiv:quant-ph/0207012},
year = {2008}
}
Comments
10 pages. Efficiency is explicitly defined. More discussion on the connection of quantum and classical games