Mini-maximizing two qubit quantum computations
Quantum Physics
2013-09-11 v2 Computer Science and Game Theory
Abstract
Two qubit quantum computations are viewed as two player, strictly competitive games and a game-theoretic measure of optimality of these computations is developed. To this end, the geometry of Hilbert space of quantum computations is used to establish the equivalence of game-theoretic solution concepts of Nash equilibrium and mini-max outcomes in games of this type, and quantum mechanisms are designed for realizing these mini-max outcomes.
Keywords
Cite
@article{arxiv.1304.0748,
title = {Mini-maximizing two qubit quantum computations},
author = {Faisal Shah Khan and Simon J. D. Phoenix},
journal= {arXiv preprint arXiv:1304.0748},
year = {2013}
}
Comments
13 pages, 1 figure. A brief discussion, explicitly stating the insights gained into two qubit quantum computations using min-max, has been added to version 2