Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Mini-maximizing two qubit quantum computations

Mini-maximizing two qubit quantum computations 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Mini-maximizing two qubit quantum computations

Khan, Faisal; Phoenix, Simon
Quantum Information Processing , Volume 12 (12) – Sep 19, 2013
Download PDF
13 pages

Loading next page...
 
/lp/springer-journals/mini-maximizing-two-qubit-quantum-computations-rUpF72qEPt

References (11)

Publisher
Springer Journals
Copyright
Copyright © 2013 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
DOI
10.1007/s11128-013-0640-7
Publisher site
See Article on Publisher Site

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.

Journal

Quantum Information Processing – Springer Journals

Published: Sep 19, 2013

There are no references for this article.