Skip to main content
Log in

Dominant strategies in two-qubit quantum computations

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Nash equilibrium is a solution concept in non-strictly competitive, noncooperative game theory that finds applications in various scientific and engineering disciplines. A non-strictly competitive, noncooperative 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Meyer, D.A.: Quantum strategies. Phys. Rev. Lett. 82, 1052–1055 (1999)

    Article  ADS  MATH  MathSciNet  Google Scholar 

  2. Eisert, J., Wilkens, M., Lewenstein, M.: Quantum games and quantum strategies. Phys. Rev. Lett. 83, 3077–3080 (1999)

    Article  ADS  MATH  MathSciNet  Google Scholar 

  3. Khan, F.S., Phoenix, S.J.D.: Gaming the quantum. Quantum Inf. Comput. 13(3&4), 231–244 (2013)

  4. Baez, J.: Quantum quandaries: a category theoretic perspective. In: The Structural Foundations of Quantum Gravity, pp. 240–265. Oxford University Press (2004)

  5. Bleiler, S.A.: A Formalism for Quantum Games and an Application. Portland State University, preprint at http://arxiv.org/abs/0808.1389 (2008)

  6. Abramsky, S., Coecke, B.: Categorical Quantum Mechanics. Handbook of Quantum Logic and Quantum Structures, vol. II. Elsevier, Amsterdam (2008)

  7. Bergholm, V., Biamonte, J.B.: Categorical quantum circuits. J. Phys. A: Math. Theor. RR1017 (2011)

  8. Khan, F.S., Phoenix, S.J.D.: Mini-maximizing two qubit quantum computations. Quantum Inf. Process. 12(12), 3807–3819 (2013)

  9. Iqbal, A., Cheon, T.: Constructing quantum games from nonfactorizable joint probabilities. Phys. Rev. E 76, 061122 (2007)

    Article  ADS  MathSciNet  Google Scholar 

  10. Nawaz, A., Toor, A.H.: Dilemma and quantum battle of sexes. J. Phys. A: Math. Gen. 37(15), 4437–4443 (2004)

    Article  ADS  MATH  MathSciNet  Google Scholar 

  11. Nawaz, A., Toor, A.H.: Evolutionarily stable strategies in quantum Hawk–Dove game. Chin. Phys. Lett. 27(5), 050303 (2010)

  12. Khan, F.S., Phoenix, S.J.D.: Khalifa University Working Paper

  13. Khan, F.S., Phoenix, S.J.D., El Hady, A.: Khalifa University Working Paper

Download references

Acknowledgments

I am grateful to Derek Abbott, Steven Bleiler, Azhar Iqbal, and Simon J. D. Phoenix for fruitful discussions. I am also indebted to the referees whose advice has elevated the quality of this paper’s presentation and results.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Faisal Shah Khan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khan, F.S. Dominant strategies in two-qubit quantum computations. Quantum Inf Process 14, 1799–1808 (2015). https://doi.org/10.1007/s11128-015-0945-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11128-015-0945-9

Keywords

Navigation