Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Advanced Computer Theory and Engineering

Experimental Implementation of Quantum Prisoner Dilemma on IBM Quantum Computers

Kanyangzi Xu, Zhe Wu

Published Sep 23, 2022• 0 citations
Publisher

Abstract

Theory of games is an important discipline of applied mathematics, which has found numerous applications in psychology, ecology, and social science. While a well-established framework has been established for classical game theory, extending, and generalizing it towards the quantum domain still has some open questions. In this project, we focus on the prisoner’s dilemma-a standard example of a game analyzed in game theory-in a quantum world. Here, we start with the quantum version of prisoner’s dilemma, explain the quantum circuit implementation for describing the behavior of quantum prisoners, and investigate how quantum entanglement can change their strategies. By using the IBM quantum computer, we experimentally study the quantum prisoner dilemma, and we conclude that the best quantum strategies will break the prisoner’s dilemma.

DOI
10.1109/icacte55855.2022.9943732

Related papers

Quantum-like dynamics of decision-making in prisoner's dilemma game

Masanari Asano, Irina Basieva, Andrei Yu. Khrennikov +2 more

In cognitive psychology, some experiments of games were reported [1, 2, 3, 4], and these demonstrated that real players did not use the "rational strategy" provided by classical game theory. To discuss probabilities of such "irrational choice", recently, we proposed a decision-making model which is based on the formalism of quantum mechanics [5, 6, 7, 8]. In this paper, we briefly explain the above model and calculate the probability of irrational choice in several prisoner's dilemma (PD) games.

AIP conference proceedings•Jan 1, 2012•8 citations

On the justification of applying quantum strategies to the Prisoners' Dilemma and mechanism design

Haoyang Wu

The Prisoners' Dilemma is perhaps the most famous model in the field of game theory. Consequently, it is natural to investigate its quantum version when one considers to apply quantum strategies to game theory. There are two main results in this paper: 1) The well-known Prisoners' Dilemma can be categorized into three types and only the third type is adaptable for quantum strategies. 2) As a reverse problem of game theory, mechanism design provides a better circumstance for quantum strategies than game theory does.

arXiv:1007.1343•Jul 8, 2010•0 citations

Quantum Game Theory

Zibo Wang

Game theory has wide implementation on many fields of study. With more recent development in quantum computation and quantum information, we are able to study games with rule of quantum mechanics. This paper consists two part: in first part, basic knowledge of game theory is briefly recalled, and prisoner’s dilemma is introduced; in second part, how quantum version game is differ from classical is discussed, and an analysis quantum version of prisoner’s dilemma is presented.

•Nov 1, 2019•0 citations

Quantum-like modelling in game theory: Quo Vadis? A brief review

Sudip Patra, Partha Ghose

Purpose The current paper is a brief review of the emerging field of quantum-like modelling in game theory. This paper aims to explore several quantum games, which are superior compared to their classical counterparts, which means either they give rise to superior Nash equilibria or they make the game fairer. For example, quantum Prisoners Dilemma generates Pareto superior outcomes as compared to defection outcome in the famous classical case. Again, a quantum-like version of cards game can make the game fairer, increasing the chance of winning of players who are disadvantaged in the classical case. This paper explores all the virtues of simple quantum games, also highlighting some findings of the authors as regards Prisoners Dilemma game. Design/methodology/approach As this is a general review paper, the authors have not demonstrated any specific mathematical method, rather explored the well-known quantum probability framework, used for designing quantum games. They have a short appendix which explores basic structure of Hilbert space representation of human decision-making. Findings Along with the review of the extant literature, the authors have also highlighted some new findings for quantum Prisoners Dilemma game. Specifically, they have shown in the earlier studies (which are referred to here) that a pure quantum entanglement set up is not needed for designing better games, even a weaker condition, which is classical entanglement is sufficient for producing Pareto improved outcomes. Research limitations/implications Theoretical research, with findings and implications for future game designs, it has been argued that it is not always needed to have true quantum entanglement for superior Nash Equilibria. Originality/value The main purpose here is to raise awareness mainly in the social science community about the possible applications of quantum-like game theory paradigm. The findings related to Prisoners Dilemma game are, however, original.

Asian Journal of Economics and Banking•Dec 3, 2020•4 citations

The Strategic Form of Quantum Prisoners' Dilemma

Ahmad Nawaz

In a normal form, prisoners' dilemma (PD) is represented by a payoff matrix showing players' strategies and payoffs. To obtain the distinguishing trait and strategic form of PD, certain constraints are imposed on the elements of its payoff matrix. We quantize PD by a generalized quantization scheme to analyze its strategic behavior in the quantum domain. The game starts with a general entangled state of the form and the measurement for payoffs is performed in entangled and product bases. We show that for both measurements, there exist respective cutoff values of entanglement of the initial quantum state up to which the strategic form of the game remains intact. Beyond these cutoffs the quantized PD behaves like the chicken game (CG) up to another cutoff value. For the measurement in the entangled basis the dilemma is resolved for sinξ > 1/7 with Q ⊗ Q as a Nash Equilibrium (NE). However, the quantized game behaves like PD when sinξ > 1/3; whereas in the range 1/7 < sinξ < 1/3 it behaves like CG with Q ⊗ Q as an NE. For the measurement in the product basis the quantized PD behaves like classical PD for with D ⊗ D as an NE. In region , the quantized PD behaves like classical CG with C ⊗ D and D ⊗ C as NEs.

Chinese Physics Letters•May 1, 2013•14 citations

The strategic form of quantum prisoners' dilemma

Ahmad Nawaz

In its normal form prisoners' dilemma (PD) is represented by a payoff matrix showing players strategies and payoffs. To obtain distinguishing trait and strategic form of PD certain constraints are imposed on the elements of its payoff matrix. We quantize PD by generalized quantization scheme to analyze its strategic behavior in quantum domain. The game starts with general entangled state of the form $\left}ψ\right\rangle =\cos\fracξ% {2}\left|00\right\rangle +i\sin\fracξ{2}\left|11\right\rangle $ and the measurement for payoffs is performed in entangled and product bases. We show that for both measurements there exist respective cutoff values of entanglement of initial quantum state up to which strategic form of game remains intact. Beyond these cutoffs the quantized PD behaves like chicken game up to another cutoff value. For the measurement in entangled basis the dilemma is resolved for\ $\sinξ>\frac{1}{7}$ with $Q\otimes Q$ as a NE but the quantized game behaves like PD when $\sinξ>\frac{1}{3}$; whereas in the range $\frac{1}{7}

arXiv:1307.6541•Jul 21, 2013•0 citations
Theory of games is an important discipline of applied mathematics, which has found numerous applications in psychology, ecology, and social science. While a well-established framework has been established for classical game theory, extending, and generalizing it towards the quantum domain still has some open questions. In this project, we focus on the prisoner’s dilemma-a standard example of a game analyzed in game theory-in a quantum world. Here, we start with the quantum version of prisoner’s dilemma, explain the quantum circuit implementation for describing the behavior of quantum prisoners, and investigate how quantum entanglement can change their strategies. By using the IBM quantum computer, we experimentally study the quantum prisoner dilemma, and we conclude that the best quantum strategies will break the prisoner’s dilemma.
In cognitive psychology, some experiments of games were reported [1, 2, 3, 4], and these demonstrated that real players did not use the "rational strategy" provided by classical game theory. To discuss probabilities of such "irrational choice", recently, we proposed a decision-making model which is based on the formalism of quantum mechanics [5, 6, 7, 8]. In this paper, we briefly explain the above model and calculate the probability of irrational choice in several prisoner's dilemma (PD) games.
The Prisoners' Dilemma is perhaps the most famous model in the field of game theory. Consequently, it is natural to investigate its quantum version when one considers to apply quantum strategies to game theory. There are two main results in this paper: 1) The well-known Prisoners' Dilemma can be categorized into three types and only the third type is adaptable for quantum strategies. 2) As a reverse problem of game theory, mechanism design provides a better circumstance for quantum strategies than game theory does.
Purpose The current paper is a brief review of the emerging field of quantum-like modelling in game theory. This paper aims to explore several quantum games, which are superior compared to their classical counterparts, which means either they give rise to superior Nash equilibria or they make the game fairer. For example, quantum Prisoners Dilemma generates Pareto superior outcomes as compared to defection outcome in the famous classical case. Again, a quantum-like version of cards game can make the game fairer, increasing the chance of winning of players who are disadvantaged in the classical case. This paper explores all the virtues of simple quantum games, also highlighting some findings of the authors as regards Prisoners Dilemma game. Design/methodology/approach As this is a general review paper, the authors have not demonstrated any specific mathematical method, rather explored the well-known quantum probability framework, used for designing quantum games. They have a short appendix which explores basic structure of Hilbert space representation of human decision-making. Findings Along with the review of the extant literature, the authors have also highlighted some new findings for quantum Prisoners Dilemma game. Specifically, they have shown in the earlier studies (which are referred to here) that a pure quantum entanglement set up is not needed for designing better games, even a weaker condition, which is classical entanglement is sufficient for producing Pareto improved outcomes. Research limitations/implications Theoretical research, with findings and implications for future game designs, it has been argued that it is not always needed to have true quantum entanglement for superior Nash Equilibria. Originality/value The main purpose here is to raise awareness mainly in the social science community about the possible applications of quantum-like game theory paradigm. The findings related to Prisoners Dilemma game are, however, original.
In a normal form, prisoners' dilemma (PD) is represented by a payoff matrix showing players' strategies and payoffs. To obtain the distinguishing trait and strategic form of PD, certain constraints are imposed on the elements of its payoff matrix. We quantize PD by a generalized quantization scheme to analyze its strategic behavior in the quantum domain. The game starts with a general entangled state of the form and the measurement for payoffs is performed in entangled and product bases. We show that for both measurements, there exist respective cutoff values of entanglement of the initial quantum state up to which the strategic form of the game remains intact. Beyond these cutoffs the quantized PD behaves like the chicken game (CG) up to another cutoff value. For the measurement in the entangled basis the dilemma is resolved for sinξ > 1/7 with Q ⊗ Q as a Nash Equilibrium (NE). However, the quantized game behaves like PD when sinξ > 1/3; whereas in the range 1/7 < sinξ < 1/3 it behaves like CG with Q ⊗ Q as an NE. For the measurement in the product basis the quantized PD behaves like classical PD for with D ⊗ D as an NE. In region , the quantized PD behaves like classical CG with C ⊗ D and D ⊗ C as NEs.
In its normal form prisoners' dilemma (PD) is represented by a payoff matrix showing players strategies and payoffs. To obtain distinguishing trait and strategic form of PD certain constraints are imposed on the elements of its payoff matrix. We quantize PD by generalized quantization scheme to analyze its strategic behavior in quantum domain. The game starts with general entangled state of the form $\left}ψ\right\rangle =\cos\fracξ% {2}\left|00\right\rangle +i\sin\fracξ{2}\left|11\right\rangle $ and the measurement for payoffs is performed in entangled and product bases. We show that for both measurements there exist respective cutoff values of entanglement of initial quantum state up to which strategic form of game remains intact. Beyond these cutoffs the quantized PD behaves like chicken game up to another cutoff value. For the measurement in entangled basis the dilemma is resolved for\ sin⁡ξ>17\sinξ>\frac{1}{7}sinξ>71​ with Q⊗QQ\otimes QQ⊗Q as a NE but the quantized game behaves like PD when sin⁡ξ>13\sinξ>\frac{1}{3}sinξ>31​; whereas in the range $\frac{1}{7}