Dominant strategies in two-qubit quantum computations

DOI10.1007/S11128-015-0945-9MaRDI QIDQ2355588zbMATH OpenOpenAlexFDO

Authors Faisal Shah Khan

Publication date 24 July 2015

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.0940

zbMATH Keywords

dominant strategiesgaming the quantumNash equilibriumquantum computation

Mathematics Subject Classification ID

Quantum computation (81P68) Noncooperative games (91A10) Applications of game theory (91A80)

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.

Recommendations

• Mini-maximizing two qubit quantum computations
• Qudits representations and computations of \(n\)-player many-valued quantum games
• A competitive game whose maximal Nash-equilibrium payoff requires quantum resources for its achievement
• Nash equilibria in quantum games
• Modeling coopetition as a quantum game

Cites work

• Categorical quantum circuits
• Categorical quantum mechanics
• Dilemma and Quantum Battle of Sexes
• Mini-maximizing two qubit quantum computations
• Quantum Games and Quantum Strategies
• Quantum quandaries: a category-theoretic perspective
• Quantum strategies

Cited in

(7)

• Characterizing the Nash equilibria of a three-player Bayesian quantum game
• Playing distributed two-party quantum games on quantum networks
• Qudits representations and computations of \(n\)-player many-valued quantum games
• Mini-maximizing two qubit quantum computations
• Quantization of blackjack: quantum basic strategy and advantage
• Quantum horse racing game
• A cellular automaton implementation of a quantum battle of the sexes game with imperfect information

This page was built for publication: Dominant strategies in two-qubit quantum computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355588)