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

arXiv:1012.0806 · Journal of Physics A Mathematical and Theoretical

Application of the Eisert–Wilkens–Lewenstein quantum game scheme to decision problems with imperfect recall

Piotr Frąckiewicz

Published Jul 20, 2011• 17 citations
arXivHTMLPDF

Abstract

We investigate implementations of the Eisert–Wilkens–Lewenstein (EWL) scheme of playing quantum games beyond strategic games. The scope of our research is decision problems, i.e. one-player extensive games. The research is based on the examination of their features when the decision problems are carried out via the EWL protocol. We prove that unitary operators can be adapted to play the role of strategies in decision problems with imperfect recall. Furthermore, we prove that unitary operators provide the decision maker with possibilities that are inaccessible for classical strategies.

DOI
10.1088/1751-8113/44/32/325304

Related papers

Non-Classical Rules in Quantum Games

Piotr Frąckiewicz

Over the last twenty years, quantum game theory has given us many ideas of how quantum games could be played. One of the most prominent ideas in the field is a model of quantum playing bimatrix games introduced by J. Eisert, M. Wilkens and M. Lewenstein. The scheme assumes that players' strategies are unitary operations and the players act on the maximally entangled two-qubit state. The quantum nature of the scheme has been under discussion since the article by Eisert et al. came out. The aim of our paper was to identify some of non-classical features of the quantum scheme.

arXiv:2012.06915•Entropy•May 13, 2021•5 citations

Permissible four-strategy quantum extensions of classical games

Piotr Frąckiewicz, Anna Gorczyca–Goraj, M. Szopa

The study focuses on strategic-form games extended in the Eisert–Wilkens–Lewenstein scheme by two unitary operations. Conditions are determined under which the pair of unitary operators, along with classical strategies, form a game invariant under isomorphic transformations of the input classical game. These conditions are then applied to determine these operators, resulting in five main classes of games satisfying the isomorphism criterion, and a theorem is proved providing a practical criterion for this isomorphism. The interdependencies between different classes of extensions are identified, including limit cases in which one class transforms into another.

arXiv:2405.07380•Quantum Information Processing•Jun 30, 2025•8 citations

Quantum Conditional Strategies and Automata for Prisoners’ Dilemmata under the EWL Scheme

Konstantinos Giannakis, Georgia Theocharopoulou, Christos Papalitsas +2 more

Classical game theory is an important field with a long tradition of useful results. Recently, the quantum versions of classical games, such as the prisoner’s dilemma (PD), have attracted a lot of attention. This game variant can be considered as a specific type of game where the player’s actions and strategies are formed using notions from quantum computation. Similarly, state machines, and specifically finite automata, have also been under constant and thorough study for plenty of reasons. The quantum analogues of these abstract machines, like the quantum finite automata, have been studied extensively. In this work, we examine well-known conditional strategies that have been studied within the framework of the classical repeated PD game. Then, we try to associate these strategies to proper quantum finite automata that receive them as inputs and recognize them with a probability of 1, achieving some interesting results. We also study the quantum version of PD under the Eisert–Wilkens–Lewenstein scheme, proposing a novel conditional strategy for the repeated version of this game.

Applied Sciences•Jun 28, 2019•24 citations

Quantum game theory for 2 2 games: a mathematical framework

Gloria Ferraris, Veronica Umanità

We develop a rigorous mathematical framework for quantum game theory applied to static 2x2 games, extending classical concepts to the quantum setting where players may employ arbitrary unitary operations (pure strategies) or probability measures over the continuous group SU(2) (mixed strategies). The Eisert-Wilkens-Lewenstein protocol is introduced as the standard implementation of quantum 2x2 games. We prove the existence of Nash equilibria for continuous quantum mixed strategies via a fixed-point argument, generalising the classical Nash theorem to the quantum case.

quant-pharXiv:2605.15747•May 18, 2026•0 citations

Quantum absentminded driver problem revisited

Piotr Frąckiewicz, Katarzyna Rycerz, M. Szopa

Abstract The aim of the paper is to study the problem of absentminded driver in the quantum domain. In the classical case, it is a well-known example of a decision problem with imperfect recall that exhibits lack of equivalence between mixed and behavioral strategies. The optimal payoff outcome is significantly lower than the maximum payoff appearing in the game. This raises the question whether a quantum approach to the problem can increase the strategic position of the decision maker. The results that we present in the paper clearly reveal the benefits from playing the absentminded problem with the aid of quantum objects. Through appropriately chosen initial quantum state, the unitary strategies enable the decision maker to obtain the maximum possible payoff. At the same time, our scheme comes down to the classical problem with a suitable restriction of unitary strategies.

Quantum Information Processing•Dec 31, 2021•2 citations

Arbitrary maximally entangled quantum prisoner’s dilemma

Abd El Hakeem Abd El Naby, Heba A. Elrayes, Ahmed M. K. Tarabia +1 more

Abstract The maximally entangled (ME) Eisert–Wilkens–Lewenstein (EWL) quantization scheme efficiently solves the classical prisoner’s dilemma (PD). Despite the intensive research on the EWL scheme, little is known about the role of the arbiter in controlling the scheme properties. We redefine the EWL scheme by introducing an arbitrary phase shift into the ME initial state. Four basic initial states were analyzed in this study. It is found that the arbiter completely controls the characteristics of the arbitrary ME quantum PD. The arbiter can adjust the ME initial state to obtain an efficient symmetric Nash equilibrium. In contrast, the arbiter can nullify the quantization advantages. Moreover, it can preserve/violate the symmetry of the game or even turn it into a potential game.

Zeitschrift für Naturforschung A•Nov 23, 2023•3 citations
We investigate implementations of the Eisert–Wilkens–Lewenstein (EWL) scheme of playing quantum games beyond strategic games. The scope of our research is decision problems, i.e. one-player extensive games. The research is based on the examination of their features when the decision problems are carried out via the EWL protocol. We prove that unitary operators can be adapted to play the role of strategies in decision problems with imperfect recall. Furthermore, we prove that unitary operators provide the decision maker with possibilities that are inaccessible for classical strategies.
Over the last twenty years, quantum game theory has given us many ideas of how quantum games could be played. One of the most prominent ideas in the field is a model of quantum playing bimatrix games introduced by J. Eisert, M. Wilkens and M. Lewenstein. The scheme assumes that players' strategies are unitary operations and the players act on the maximally entangled two-qubit state. The quantum nature of the scheme has been under discussion since the article by Eisert et al. came out. The aim of our paper was to identify some of non-classical features of the quantum scheme.
The study focuses on strategic-form games extended in the Eisert–Wilkens–Lewenstein scheme by two unitary operations. Conditions are determined under which the pair of unitary operators, along with classical strategies, form a game invariant under isomorphic transformations of the input classical game. These conditions are then applied to determine these operators, resulting in five main classes of games satisfying the isomorphism criterion, and a theorem is proved providing a practical criterion for this isomorphism. The interdependencies between different classes of extensions are identified, including limit cases in which one class transforms into another.
Classical game theory is an important field with a long tradition of useful results. Recently, the quantum versions of classical games, such as the prisoner’s dilemma (PD), have attracted a lot of attention. This game variant can be considered as a specific type of game where the player’s actions and strategies are formed using notions from quantum computation. Similarly, state machines, and specifically finite automata, have also been under constant and thorough study for plenty of reasons. The quantum analogues of these abstract machines, like the quantum finite automata, have been studied extensively. In this work, we examine well-known conditional strategies that have been studied within the framework of the classical repeated PD game. Then, we try to associate these strategies to proper quantum finite automata that receive them as inputs and recognize them with a probability of 1, achieving some interesting results. We also study the quantum version of PD under the Eisert–Wilkens–Lewenstein scheme, proposing a novel conditional strategy for the repeated version of this game.
We develop a rigorous mathematical framework for quantum game theory applied to static 2x2 games, extending classical concepts to the quantum setting where players may employ arbitrary unitary operations (pure strategies) or probability measures over the continuous group SU(2) (mixed strategies). The Eisert-Wilkens-Lewenstein protocol is introduced as the standard implementation of quantum 2x2 games. We prove the existence of Nash equilibria for continuous quantum mixed strategies via a fixed-point argument, generalising the classical Nash theorem to the quantum case.
Abstract The aim of the paper is to study the problem of absentminded driver in the quantum domain. In the classical case, it is a well-known example of a decision problem with imperfect recall that exhibits lack of equivalence between mixed and behavioral strategies. The optimal payoff outcome is significantly lower than the maximum payoff appearing in the game. This raises the question whether a quantum approach to the problem can increase the strategic position of the decision maker. The results that we present in the paper clearly reveal the benefits from playing the absentminded problem with the aid of quantum objects. Through appropriately chosen initial quantum state, the unitary strategies enable the decision maker to obtain the maximum possible payoff. At the same time, our scheme comes down to the classical problem with a suitable restriction of unitary strategies.
Abstract The maximally entangled (ME) Eisert–Wilkens–Lewenstein (EWL) quantization scheme efficiently solves the classical prisoner’s dilemma (PD). Despite the intensive research on the EWL scheme, little is known about the role of the arbiter in controlling the scheme properties. We redefine the EWL scheme by introducing an arbitrary phase shift into the ME initial state. Four basic initial states were analyzed in this study. It is found that the arbiter completely controls the characteristics of the arbitrary ME quantum PD. The arbiter can adjust the ME initial state to obtain an efficient symmetric Nash equilibrium. In contrast, the arbiter can nullify the quantization advantages. Moreover, it can preserve/violate the symmetry of the game or even turn it into a potential game.