2000 character limit reached
Dominant Strategies in Two Qubit Quantum Computations
Published 3 Oct 2014 in quant-ph, cs.GT, math-ph, math.MP, and math.OC | (1410.0940v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.