Dominant Strategies in Two Qubit Quantum Computations

TL;DR

This paper introduces a game-theoretic framework for analyzing two-qubit quantum computations using Nash equilibrium, providing a new perspective on optimality and constrained optimization in quantum systems.

Contribution

It presents a novel game model for two-qubit quantum computations that characterizes Nash equilibrium through inner products in the state space.

Findings

Nash equilibrium can be characterized in two-qubit systems.

The framework offers a new measure for constrained optimization in quantum computing.

Equilibrium outcomes are shown to be optimal under specific constraints.

Abstract

Nash equilibrium is a solution concept in non-strictly competitive, non-cooperative game theory that finds applications in various scientific and engineering disciplines. A non-strictly competitive, non-cooperative game model is presented here for two qubit quantum computations that allows for the characterization of Nash equilibrium in these computations via the inner product of their state space. Nash equilibrium outcomes are optimal under given constraints and therefore offer a game-theoretic measure of constrained optimization of two qubit quantum computations.