Mini-maximizing two qubit quantum computations

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.

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

References in corpus (1)

• A Formalism for Quantum Games and an Application

Cited by in corpus (10)

• Quantum games: a review of the history, current state, and interpretation
• Evolutionary Processes in Quantum Decision Theory
• Preferences in Quantum Games
• Nash embedding and equilibrium in pure quantum states
• Solving diner's dilemma game, circuit implementation, and verification on IBMQ simulator
• Dominant Strategies in Two Qubit Quantum Computations
• Use of Nash equilibrium in finding game theoretic robust security bound on quantum bit error rate
• No fixed-point guarantee of Nash equilibrium in quantum games
• Non-Abelian strategies in quantum penny flip game
• Nash equilibrium quantum states and optimal quantum data classification