pith. sign in

arxiv: 1304.0748 · v2 · pith:BQKIBGFTnew · submitted 2013-04-02 · 🪐 quant-ph · cs.GT

Mini-maximizing two qubit quantum computations

classification 🪐 quant-ph cs.GT
keywords computationsquantumgame-theoreticgamesmini-maxoutcomesqubitcompetitive
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.