Mini-maximizing two qubit quantum computations

Authors:
Faisal Shah Khan;Simon J. Phoenix
Affiliations:
Department of Applied Mathematics and Sciences, Khalifa University, Abu Dhabi, UAE;Department of Electrical and Computer Engineering, Khalifa University, Abu Dhabi, UAE
Venue:
Quantum Information Processing
Year:
2013

Citing 3
Cited 0

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Gaming the quantum

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

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.