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

Modern Physics Letters A

Implementing quantum prisoner dilemma via different classes of entangled and separable states

A. T. M. Makram-Allah, Mahmoud Youssef Abd‐Rabbou, NASSER METWALLY

Published Jul 18, 2025• 2 citations
Publisher

Abstract

The possibility of implementing the prisoner’s dilemma game using different classes of initial states between the players is discussed. Different behaviors of the payoffs have been exhibited, may it increase, decrease or be fixed. These behaviors depend on the used initial state either maximum/partial entangled, the chosen entangling gate, and the strategies employed by each player. The increased payoff is displayed when the players adopt different defect strategies, while the fixed payoff is shown when both players apply the same defect strategy. The maximum bounds of the payoff can be attained if the players initially share a maximum entangled state. The maximum/minimum fixed payoff depends on the used entangling gate, where the maximum one is shown if the players send their final states to entangling gate. It is shown that, the nature of the payoff, whether stationary, increasing or decreasing is contingent upon the polarization of the initial state and the used defect strategy. However, if both states are polarized on the same axis direction, the predicted maximum payoff is smaller than that obtained if the initial state is polarized in different polarization of the same axis. Therefore, the initial state settings, entangling parameter and the choice of the defect strategy can be used as control tools to maximize/minimize the obtained payoff.

DOI
10.1142/s0217732325501093

Related papers

The Superiority of Quantum Strategy in 3-Player Prisoner’s Dilemma

Zhiyuan Dong, Ai‐Guo Wu

In this paper, we extend the quantum game theory of Prisoner’s Dilemma to the N-player case. The final state of quantum game theory of N-player Prisoner’s Dilemma is derived, which can be used to investigate the payoff of each player. As demonstration, two cases (2-player and 3-player) are studied to illustrate the superiority of quantum strategy in the game theory. Specifically, the non-unique entanglement parameter is found to maximize the total payoff, which oscillates periodically. Finally, the optimal strategic set is proved to depend on the selection of initial states.

Mathematics•Jun 21, 2021•2 citations

Communication aspects of a three-player Prisoner's Dilemma quantum game

Muhammad Asif Ramzan, Majid Khan

We present a quantization scheme for a three-player Prisoner's Dilemma game. It is shown that entanglement plays a dominant role in the three-player quantum game. Four different types of payoffs are identified on the basis of different combinations of initial state and measurement basis entanglement parameters. A relation among these different payoffs is also established. We also study the communication aspects of the three-player game. By exploiting different combinations of initial state and measurement basis entanglement parameters, we establish a relationship for the information shared among the parties. It is seen that the strategies of the players act as carriers of information in quantum games.

arXiv:0902.4760•Journal of Physics A Mathematical and Theoretical•Nov 25, 2008•8 citations

Unique Solution to the Quantum Prisoner’s Dilemma Game

Ahmed S. Elgazzar

A quantized version of the prisoner’s dilemma game based on the Marinatto–Weber quantization scheme is introduced. A four-qubit-basis initial entangled quantum state is assumed. Two domains for Nash equilibria are observed in terms of the degree of entanglement of the game. Each Nash equilibrium point is found to be Pareto optimal in its corresponding domain. Therefore, there is a unique solution to the game dilemma in each domain of the entanglement parameter. The maximally entangled limit is studied, and the players’ payoffs are found to equal the average of the payoff matrix independently of their choices. Consequently, any combination of players’ choices is a solution to the dilemma of the game. The nonentangled limits are also studied and found to coincide with the classical mixed-strategy game. Our results are equivalent to those of the noisy schemes of the quantum prisoner’s dilemma game. In our scheme, entanglement can be interpreted as a noise.

Journal of the Physical Society of Japan•Feb 1, 2019•11 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.

arXiv:1307.6541•Chinese Physics Letters•May 1, 2013•13 citations

Initial State Time-Dependent Quantum Game

A. T. M. Makram-Allah, Mahmoud Youssef Abd‐Rabbou, NASSER METWALLY

The possibility of implementing a time dependent version of Eisert, Wilkens, and Lewenstein (EWL), quantum game is discussed. It is assumed that the players initial states are time dependent, while the entangling quantum gate either time dependent or independent during the game. The obtained results shows that the players payoff depend on their initial state, while The time-independent entangling gate has a minor impact on the game compared to its time-dependent counterpart. However, one can improve the lower bounds of the payoffs by using time dependent gate. Moreover, the exponential form of the entangling power is more powerful than the linear one, where the payoffs are much better. However, the maximum potential rewards in this game may be lower than those attainable in the classical game, the minimum guaranteed outcomes are much better.

International Conference on Data Analytics for Business and Industry (ICDABI)•Oct 23, 2024•1 citation

Prisoner's Dilemma in Quantum Perspective

Charnaditya Padakandla Venkata

It is known that quantum strategies change the range of possible payoffs for the players in the prisoner's dilemma. In this paper, we examine the effect of the degree of entanglement in determining the payoffs. When both players play quantum strategies, we show that the payoff for both players is unaffected by the entanglement value and it leads to a new Nash equilibrium.

•May 1, 2022•0 citations
The possibility of implementing the prisoner’s dilemma game using different classes of initial states between the players is discussed. Different behaviors of the payoffs have been exhibited, may it increase, decrease or be fixed. These behaviors depend on the used initial state either maximum/partial entangled, the chosen entangling gate, and the strategies employed by each player. The increased payoff is displayed when the players adopt different defect strategies, while the fixed payoff is shown when both players apply the same defect strategy. The maximum bounds of the payoff can be attained if the players initially share a maximum entangled state. The maximum/minimum fixed payoff depends on the used entangling gate, where the maximum one is shown if the players send their final states to entangling gate. It is shown that, the nature of the payoff, whether stationary, increasing or decreasing is contingent upon the polarization of the initial state and the used defect strategy. However, if both states are polarized on the same axis direction, the predicted maximum payoff is smaller than that obtained if the initial state is polarized in different polarization of the same axis. Therefore, the initial state settings, entangling parameter and the choice of the defect strategy can be used as control tools to maximize/minimize the obtained payoff.
In this paper, we extend the quantum game theory of Prisoner’s Dilemma to the N-player case. The final state of quantum game theory of N-player Prisoner’s Dilemma is derived, which can be used to investigate the payoff of each player. As demonstration, two cases (2-player and 3-player) are studied to illustrate the superiority of quantum strategy in the game theory. Specifically, the non-unique entanglement parameter is found to maximize the total payoff, which oscillates periodically. Finally, the optimal strategic set is proved to depend on the selection of initial states.
We present a quantization scheme for a three-player Prisoner's Dilemma game. It is shown that entanglement plays a dominant role in the three-player quantum game. Four different types of payoffs are identified on the basis of different combinations of initial state and measurement basis entanglement parameters. A relation among these different payoffs is also established. We also study the communication aspects of the three-player game. By exploiting different combinations of initial state and measurement basis entanglement parameters, we establish a relationship for the information shared among the parties. It is seen that the strategies of the players act as carriers of information in quantum games.
A quantized version of the prisoner’s dilemma game based on the Marinatto–Weber quantization scheme is introduced. A four-qubit-basis initial entangled quantum state is assumed. Two domains for Nash equilibria are observed in terms of the degree of entanglement of the game. Each Nash equilibrium point is found to be Pareto optimal in its corresponding domain. Therefore, there is a unique solution to the game dilemma in each domain of the entanglement parameter. The maximally entangled limit is studied, and the players’ payoffs are found to equal the average of the payoff matrix independently of their choices. Consequently, any combination of players’ choices is a solution to the dilemma of the game. The nonentangled limits are also studied and found to coincide with the classical mixed-strategy game. Our results are equivalent to those of the noisy schemes of the quantum prisoner’s dilemma game. In our scheme, entanglement can be interpreted as a noise.
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.
The possibility of implementing a time dependent version of Eisert, Wilkens, and Lewenstein (EWL), quantum game is discussed. It is assumed that the players initial states are time dependent, while the entangling quantum gate either time dependent or independent during the game. The obtained results shows that the players payoff depend on their initial state, while The time-independent entangling gate has a minor impact on the game compared to its time-dependent counterpart. However, one can improve the lower bounds of the payoffs by using time dependent gate. Moreover, the exponential form of the entangling power is more powerful than the linear one, where the payoffs are much better. However, the maximum potential rewards in this game may be lower than those attainable in the classical game, the minimum guaranteed outcomes are much better.