Skip to main content
Log in

Maximal Parrondo’s Paradox for Classical and Quantum Markov Chains

  • Published:
Letters in Mathematical Physics Aims and scope Submit manuscript

Abstract

Parrondo’s paradox refers to the situation where two, multi-round games with a fixed winning criteria, both with probability greater than one-half for one player to win, are combined. Using a possibly biased coin to determine the rule to employ for each round, paradoxically, the previously losing player now wins the combined game with probability greater than one-half. In this paper, we will analyze classical observed, classical hidden, and quantum versions of a game that displays this paradox. The game we have utilized is simpler than games for which this behavior has been previously noted in the classical and quantum cases. We will show that in certain situations the paradox can occur to a greater degree in the quantum version than is possible in the classical versions.

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. Feller W.: An Introduction to Probability Theory and its Applications. Wiley, New York (1950)

    MATH  Google Scholar 

  2. Flitney A.P., Ng J., Abbott D.: Quantum Parrondo’s games. Physica A. 314, 35–42 (2002)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  3. Harmer G.P., Abbott D.: Parrondo’s paradox. Stat. Sci. 14(2), 206–213 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Jensen F.V.: Bayesian Networks and Decision Graphs (Statistics for Engineering and Information Science). Springer, New York (2001)

    Book  Google Scholar 

  5. Kraus K.: States, Effects, and Operations: Fundamental Notions of Quantum Physics (Lecture Notes in Physics). Springer, Berlin (1983)

    Book  MATH  Google Scholar 

  6. Lorenzo A.D.: Reassessment of Leggett inequality. Found. Phys. 43, 685–698 (2013)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  7. Martin J.J.: Bayesian decision problem and Markov chains. Wiley, New York (1967)

    Google Scholar 

  8. Meyer, D.A.: Noisy quantum Parrondo game. Unpublished.

  9. Norris J.R.: Markov Chains (Cambridge Series in Statistical and Probabilistic Mathematics). Cambridge University Press, Cambridge (1997)

    Google Scholar 

  10. Parrondo J., Dinis L.: Brownian motion and gambling: from ratchets to paradoxical games. Contemp. Phys. 64(2), 147–157 (2004)

    Article  ADS  Google Scholar 

  11. Pejic, M.: Bayesian quantum networks with application to games displaying Parrondo’s paradox. (2015). http://arxiv.org/abs/1503.08868

  12. Rao M.M.: Measure Theory and Integration. Wiley, New York (1987)

    MATH  Google Scholar 

  13. Royden, H.L.: Real Analysis, 3rd edn. Prentice Hall, Upper Saddle River (1988)

  14. Seneta E.: Non-Negative Matrices and Markov Chains (Springer Series in Statistics). Springer, New York (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michael Pejic.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Grünbaum, F.A., Pejic, M. Maximal Parrondo’s Paradox for Classical and Quantum Markov Chains. Lett Math Phys 106, 251–267 (2016). https://doi.org/10.1007/s11005-015-0812-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11005-015-0812-8

Mathematics Subject Classification

Keywords

Navigation