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

Quantum Information Processing

Quantum absentminded driver problem revisited

Piotr Frąckiewicz, Katarzyna Rycerz, M. Szopa

Published Dec 31, 2021• 2 citations
Publisher

Abstract

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.

DOI
10.1007/s11128-021-03377-6

Related papers

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

Piotr Frąckiewicz

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.

arXiv:1012.0806•Journal of Physics A Mathematical and Theoretical•Jul 20, 2011•17 citations

Incomplete information and quantum decision trees

Subhash C. Kak

This paper considers the problem of the absent-minded driver who must choose between alternatives with different payoff under the conditions of imperfect recall and varying degrees of knowledge of the system. We show that agents with access to quantum resources, or with a quantum mechanical basis, can obtain superior performance as compared to classical agents. The paper also considers the problem of random tree representations of quantum decision processes. It is shown that in the general case where each node can have any branching probability value, a random tree can accurately represent the probabilities associated with an arbitrary quantum state.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 1, 2017•2 citations

Quantum Game with Restricted Matrix Strategies

Bo Chen, Ma Ying-Jun, Long Gui-Lu

We study a quantum game played by two players with restricted multiple strategies. It is found that in this restricted quantum game Nash equilibrium does not always exist when the initial state is entangled. At the same time, we find that when Nash equilibrium exists the payoff function is usually different from that in the classical counterpart except in some special cases. This presents an explicit example showing quantum game and classical game may differ. When designing a quantum game with limited strategies, the allowed strategy should be carefully chosen according to the type of initial state.

arXiv:quant-ph/0301062•Communications in Theoretical Physics•Dec 15, 2003•2 citations

Study of quantum games

Ahmad Razavi

Game theory is the study of strategic competition used in many branches of science. In general, a game is a match between two or more players and each wants to maximize his or her score. In a game, the player’s score depends on their strategies. The goal is to find the optimized decision, with regard to the payoff, in conformity with the rules of the game. This thesis considers the games with two players who know both their own and their rival’s payoff. However, they do not know the strategy chosen by the opponent.\nIn a classical game, the options of players are referred to as cooperation and defect. Quantum game theory is a generalization of classical game theory. In quantum games a linear combination of two options specify the strategy based on qubit. The quantum domain is characterized by entanglement. The quantum entanglement coefficient (y) varies from 0 to . The game is in the classical regime when y is smaller than a threshold. Quantum entanglement is intrinsically non-local.\nIn an iterated game tournament, 63 different strategies contest with four known strategies. Depending on the result, they are divided to a number of groups. The competition specifies which group of strategies can obtain a higher score.\nOther types of games are discussed in the thesis. They are known as incomplete information games. In these games one player has two payoff matrixes, and the rival does not know which of them is used. We discuss the advantage of using quantum strategy over the classical game, particular in avoiding the dilemma in classical games.

•Jan 1, 2015•0 citations

Does the Quantum Player Always Win the Classical One?

Zhao Hai-Jun, Fang Xi-Ming

We study quantum games in which the players have different strategic spaces. We find that the player who can use a quantum strategic space does not always possess more payoffs than the player who is restricted to apply only classical strategies. We find the condition of the classical player getting more payoffs than the quantum player. We also find that the game exhibits intriguing structures.

Chinese Physics Letters•Jul 30, 2004•4 citations

Quantum signaling game

Piotr Frąckiewicz

We present a quantum approach to a signaling game; a special kind of extensive game of incomplete information. Our model is based on quantum schemes for games in strategic form where players perform unitary operators on their own qubits of some fixed initial state and the payoff function is given by a measurement on the resulting final state. We show that the quantum game induced by our scheme coincides with a signaling game as a special case and outputs nonclassical results in general. As an example, we consider a quantum extension of the signaling game in which the chance move is a three-parameter unitary operator whereas the players' actions are equivalent to classical ones. In this case, we study the game in terms of Nash equilibria and refine the pure Nash equilibria adapting to the quantum game the notion of a weak perfect Bayesian equilibrium.

arXiv:1407.6757•Journal of Physics A Mathematical and Theoretical•Jul 10, 2014•6 citations
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.
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.
This paper considers the problem of the absent-minded driver who must choose between alternatives with different payoff under the conditions of imperfect recall and varying degrees of knowledge of the system. We show that agents with access to quantum resources, or with a quantum mechanical basis, can obtain superior performance as compared to classical agents. The paper also considers the problem of random tree representations of quantum decision processes. It is shown that in the general case where each node can have any branching probability value, a random tree can accurately represent the probabilities associated with an arbitrary quantum state.
We study a quantum game played by two players with restricted multiple strategies. It is found that in this restricted quantum game Nash equilibrium does not always exist when the initial state is entangled. At the same time, we find that when Nash equilibrium exists the payoff function is usually different from that in the classical counterpart except in some special cases. This presents an explicit example showing quantum game and classical game may differ. When designing a quantum game with limited strategies, the allowed strategy should be carefully chosen according to the type of initial state.
Game theory is the study of strategic competition used in many branches of science. In general, a game is a match between two or more players and each wants to maximize his or her score. In a game, the player’s score depends on their strategies. The goal is to find the optimized decision, with regard to the payoff, in conformity with the rules of the game. This thesis considers the games with two players who know both their own and their rival’s payoff. However, they do not know the strategy chosen by the opponent.\nIn a classical game, the options of players are referred to as cooperation and defect. Quantum game theory is a generalization of classical game theory. In quantum games a linear combination of two options specify the strategy based on qubit. The quantum domain is characterized by entanglement. The quantum entanglement coefficient (y) varies from 0 to . The game is in the classical regime when y is smaller than a threshold. Quantum entanglement is intrinsically non-local.\nIn an iterated game tournament, 63 different strategies contest with four known strategies. Depending on the result, they are divided to a number of groups. The competition specifies which group of strategies can obtain a higher score.\nOther types of games are discussed in the thesis. They are known as incomplete information games. In these games one player has two payoff matrixes, and the rival does not know which of them is used. We discuss the advantage of using quantum strategy over the classical game, particular in avoiding the dilemma in classical games.
We present a quantum approach to a signaling game; a special kind of extensive game of incomplete information. Our model is based on quantum schemes for games in strategic form where players perform unitary operators on their own qubits of some fixed initial state and the payoff function is given by a measurement on the resulting final state. We show that the quantum game induced by our scheme coincides with a signaling game as a special case and outputs nonclassical results in general. As an example, we consider a quantum extension of the signaling game in which the chance move is a three-parameter unitary operator whereas the players' actions are equivalent to classical ones. In this case, we study the game in terms of Nash equilibria and refine the pure Nash equilibria adapting to the quantum game the notion of a weak perfect Bayesian equilibrium.