Infinitely repeated quantum games and strategic efficiency

Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied, however less is known for infinitely repeated quantum games. Investigating infinitely repeated games is crucial since finitely repeated games do not much differ from single round games. In this work we establish the concept of general repeated quantum games and show the Quantum Folk Theorem, which claims that by iterating a game one can find an equilibrium strategy of the game and receive reward that is not obtained by a Nash equilibrium of the corresponding single round quantum game. A significant difference between repeated quantum prisoner’s dilemma and repeated classical prisoner’s dilemma is that the classical Pareto optimal solution is not always an equilibrium of the repeated quantum game when entanglement is sufficiently strong. When entanglement is sufficiently strong and reward is small, mutual cooperation cannot be an equilibrium of the repeated quantum game. In addition we present several concrete equilibrium strategies of the repeated quantum prisoner’s dilemma. ar X iv :2 00 5. 05 58 8v 3 [ qu an tph ] 2 7 N ov 2 02 1

[1]  Sayantan Nag Chowdhury,et al.  Complex evolutionary dynamics due to punishment and free space in ecological multi-games , 2021, Proceedings of the Royal Society A.

[2]  E. Rowland Theory of Games and Economic Behavior , 1946, Nature.

[3]  Drew Fudenberg,et al.  The Folk Theorem in Repeated Games with Discounting or with Incomplete Information , 1986 .

[4]  Quantum contracts between Schrödinger and a cat , 2021, Quantum Inf. Process..

[5]  A. H. Toor,et al.  Quantum repeated games , 2002 .

[6]  Qiang Li,et al.  Effects of adaptive degrees of trust on coevolution of quantum strategies on scale-free networks , 2013, Scientific Reports.

[7]  Kazuki Ikeda,et al.  Foundation of quantum optimal transport and applications , 2019, Quantum Information Processing.

[8]  Dilip Abreu On the Theory of Infinitely Repeated Games with Discounting , 1988 .

[9]  M. Perc,et al.  Coevolution of Quantum and Classical Strategies on Evolving Random Networks , 2013, PloS one.

[10]  Travis S. Humble,et al.  Quantum games: a review of the history, current state, and interpretation , 2018, Quantum Information Processing.

[11]  D. Meyer Quantum strategies , 1998, quant-ph/9804010.

[12]  Kazuki Ikeda,et al.  Theory of quantum games and quantum economic behavior , 2020, Quantum Information Processing.

[13]  Seth Lloyd,et al.  Quantum Generative Adversarial Learning. , 2018, Physical review letters.

[14]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[15]  J. Eisert,et al.  Quantum Games and Quantum Strategies , 1998, quant-ph/9806088.

[16]  Piotr Frackiewicz,et al.  Quantum repeated games revisited , 2011, ArXiv.

[17]  Travis S. Humble,et al.  Nash Embedding and Equilibrium in Pure Quantum States , 2018, QTOP@NetSys.