Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Quantum Physics

arXiv:1304.0748 (quant-ph)
[Submitted on 2 Apr 2013 (v1), last revised 10 Sep 2013 (this version, v2)]

Title:Mini-maximizing two qubit quantum computations

Authors:Faisal Shah Khan, Simon J.D. Phoenix
View PDF
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.
Comments: 13 pages, 1 figure. A brief discussion, explicitly stating the insights gained into two qubit quantum computations using min-max, has been added to version 2
Subjects: Quantum Physics (quant-ph); Computer Science and Game Theory (cs.GT)
Cite as: arXiv:1304.0748 [quant-ph]
  (or arXiv:1304.0748v2 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.1304.0748
Related DOI: https://doi.org/10.1007/s11128-013-0640-7

Submission history

From: Faisal Khan [view email]
[v1] Tue, 2 Apr 2013 19:33:03 UTC (172 KB)
[v2] Tue, 10 Sep 2013 04:51:59 UTC (171 KB)
Full-text links:

Access Paper:

view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2013-04
Change to browse by:
cs
cs.GT

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)