Mini-maximizing two qubit quantum computations

DOI10.1007/S11128-013-0640-7MaRDI QIDQ479375zbMATH OpenOpenAlexFDO

Authors Faisal Shah Khan, Simon J. D. Phoenix

Publication date 5 December 2014

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

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

zbMATH Keywords

Nash equilibriumgaming the quantummini-maxoptimal quantum computation

Mathematics Subject Classification ID

Applications of game theory (91A80) Quantum computation (81P68) Nash functions and manifolds (14P20)

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.

Recommendations

• Quantum strategies
• Dominant strategies in two-qubit quantum computations
• Can a game be quantum?
• Quantum strategic game theory
• QUANTUM OCTAL GAMES

Cites work

• scientific article; zbMATH DE number 54099 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2103535 (Why is no real title available?)
• A Mathematical Theory of Communication
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited in

(10)

• A cellular automaton implementation of a quantum battle of the sexes game with imperfect information
• Preferences in quantum games
• Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity
• Quantum games: a review of the history, current state, and interpretation
• A probabilistic approach to quantum Bayesian games of incomplete information
• Qudits representations and computations of \(n\)-player many-valued quantum games
• Influence of initial conditions in \(2\times 2\) symmetric games
• Multiplayer quantum games and its application as access controller in architecture of quantum computers
• Solving diner's dilemma game, circuit implementation and verification on the IBM quantum simulator
• Dominant strategies in two-qubit quantum computations

This page was built for publication: Mini-maximizing two qubit quantum computations

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