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:quant-ph/0208171

On Pay-off induced Quantum Games

F. M. C. Witte

Published Aug 28, 2002• 4 citations
arXivHTMLPDF

Abstract

In recent years methods have been proposed to extend classical game theory into the quantum domain. This paper explores further extensions of these ideas that may have a substantial potential for further research. Upon reformulating quantum game theory as a theory of classical games played by "quantum players" I take a constructive approach. The roles of the players and the arbiter are investigated for clues on the nature of the quantum game space. Upon examination of the role of the arbiter, a possible non-commutative nature of pay-off operators can be deduced. I investigate a sub-class of games in which the pay-off operators satisfy non-trivial commutation relations. Non-abelian pay-off operators can be used to generate whole families of quantum games.

DOI
10.48550/arxiv.quant-ph/0208171

Related papers

Quantum 2-Player Gambling and Correlated Pay-Off

F. M. C. Witte

In recent years methods have been proposed to extend classical game theory into the quantum domain. In a previous publication the nature of several non-cummutative games was briefly analyzed. Here we give an analysis of the simplest non-commutative quantum game, which is a gambling game much like simple heads or tails. The quantum game displays strategies which, though non direct-product strategies, allow for correlations between the players pay-off.

arXiv:quant-ph/0207085•Physica Scripta•Jan 1, 2005•6 citations

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

A necessary and sufficient condition to play games in quantum mechanical settings

Şahin Kaya Özdemir, Junichi Shimamura, N. Imoto

Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.

arXiv:quant-ph/0508105•New Journal of Physics•Feb 28, 2007•59 citations

Quantumizing Classical Games: An Introduction to Quantum Game Theory

Sowmitra Das

We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing this body of work, we formulate a protocol to $\textit{Quantumize}$ any finite classical $n$-player game, and use a novel approach of describing such a Quantum Game in terms of commuting Payoff Operators. We describe what advantages can be gained by players by quantumizing such a game, particularly, what additional Nash Equilibria the players can achieve and the Pareto-Optimality of these additional equilibria.

arXiv:2305.00368•Apr 30, 2023•5 citations

An Investigation of Quantum Computational Game Theory

Scott Ricketts, Max Mintz

Game theory is a well established field with applications in many areas including the social sciences, biology, and computer science [6]. Recently, however, researchers in quantum computation have begun to study the implications of games set in the quantum domain (i.e. game theoretical situations where either one or more players have quantum computational power or where the implementation of strategies uses some form of quantum information). Such a setting allows for entanglement and superpositions of strategies and evaluation of payoffs using quantum measurement. This approach to game theory, according to some scholars in the field, could help us understand certain physical systems, improve economic markets, and develop quantum algorithms. I have conducted an investigation into quantum game theory. I have constructed simulation tools using Maple that, along with research into related work, have helped gain some insight into this new field. The important solutions in classical game theory are usually Nash equilibria. What do they look like in the quantum realm? In what

•Jan 1, 2006•0 citations

Application of Game-theoretic Techniques to Quantum Information Theory

Muhammad Asif Ramzan

This work is mainly based on quantum game-theoretic techniques and their application to quantum information theory.Quantum game theory is an important development in quantum computation and may have implications for quantum information and quantum communication.The select of quantum memory on quantum games have been studied.Three di􀀞erent games such as, Prisoner Dilemma, Battle of the Sexes and Chicken have been analyzed in the quantum domain. By considering the restricted game \nsituation, it is shown that the ects of quantum memory and decoherence become e􀀞ective in a maximally entangled case.For which the quantum player can out perform the classical player in all the three games. It is also shown that the quantum player enjoys an advantage over the classical player in Battle of the Sexes game for the amplitude-damping and the depolarizing channels.The quantum memory compensates the reduction in player pay is due to decoherence. It has no ect on the Nash equilibria of the three games.A generalization of two-player quantization scheme to a three-player Prisoners Dilemma game under the ect of correlated noise is also presented.In a restricted game scenario, it is shown the quantumplayer is always better; for all values of the decoherence parameter for the entire range of memory parameter.It is seen that for maximum degree of correlation, the game does not become \nnoiseless and quantum player can still outscore the classical players for the entire range of the decoherence parameter producing an interesting result in comparison with a two-player quantum game.It is also shown that correlated noise has not on the Nash equilibrium of the game.By exploiting the three-player quantization scheme, we have studiedthe communication aspects of a three-player Prisoner Dilemma quantum game. It is shown that entanglement plays a dominant role in a three-player quantum game.On the baois of initial state and the measurement basis entanglement parameters, a relation among different pay is established.It is investigated that the strategies of the players act as information carriers in quantum games. A relationship for the information shared among the parties is also established.A scheme for quantum key distribution is proposed in which a secret key can be generated from the data coming through a partially entanglement breaking channel.This scheme is rather deterministic andcient in the sense that two classical bits can be transferred \nper entangled pair of qubits.Furthermore, it is important to point out that, in this scheme, same symbol can be used for Eve detection and key generation. It is also worth noting that the eavesdropper, Eve, can be detected very easily from the disturbance of the elements of the decoding bimatrix. We have checked for the \nsecurity of the scheme and found it secure against individual attacks.It is further investigated that quantum games are useful in developing quantum cryptographic protocols.A multiparty quantum cryptographic protocol using tripartite entangled GHZ states is devised using game-theoretic techniques.In this protocol, two classical bits can be transferred per entangled pair of qubits to the communicating parties.Unitary operators applied by the sender on a tripartite entangled state encodes a classical symbol that can be decoded at receiver end with the help of a decoding matrix. In this protocol, if Eve interferes during the transmission, she can be detected by the disturbance of the decoding matrix. Our security analysis shows that this protocol is also secure against intercept/re-send attacks.

•Jan 1, 2010•0 citations
In recent years methods have been proposed to extend classical game theory into the quantum domain. This paper explores further extensions of these ideas that may have a substantial potential for further research. Upon reformulating quantum game theory as a theory of classical games played by "quantum players" I take a constructive approach. The roles of the players and the arbiter are investigated for clues on the nature of the quantum game space. Upon examination of the role of the arbiter, a possible non-commutative nature of pay-off operators can be deduced. I investigate a sub-class of games in which the pay-off operators satisfy non-trivial commutation relations. Non-abelian pay-off operators can be used to generate whole families of quantum games.
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.
Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.
We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing this body of work, we formulate a protocol to Quantumize\textit{Quantumize}Quantumize any finite classical nnn-player game, and use a novel approach of describing such a Quantum Game in terms of commuting Payoff Operators. We describe what advantages can be gained by players by quantumizing such a game, particularly, what additional Nash Equilibria the players can achieve and the Pareto-Optimality of these additional equilibria.
Game theory is a well established field with applications in many areas including the social sciences, biology, and computer science [6]. Recently, however, researchers in quantum computation have begun to study the implications of games set in the quantum domain (i.e. game theoretical situations where either one or more players have quantum computational power or where the implementation of strategies uses some form of quantum information). Such a setting allows for entanglement and superpositions of strategies and evaluation of payoffs using quantum measurement. This approach to game theory, according to some scholars in the field, could help us understand certain physical systems, improve economic markets, and develop quantum algorithms. I have conducted an investigation into quantum game theory. I have constructed simulation tools using Maple that, along with research into related work, have helped gain some insight into this new field. The important solutions in classical game theory are usually Nash equilibria. What do they look like in the quantum realm? In what
This work is mainly based on quantum game-theoretic techniques and their application to quantum information theory.Quantum game theory is an important development in quantum computation and may have implications for quantum information and quantum communication.The select of quantum memory on quantum games have been studied.Three di􀀞erent games such as, Prisoner Dilemma, Battle of the Sexes and Chicken have been analyzed in the quantum domain. By considering the restricted game \nsituation, it is shown that the ects of quantum memory and decoherence become e􀀞ective in a maximally entangled case.For which the quantum player can out perform the classical player in all the three games. It is also shown that the quantum player enjoys an advantage over the classical player in Battle of the Sexes game for the amplitude-damping and the depolarizing channels.The quantum memory compensates the reduction in player pay is due to decoherence. It has no ect on the Nash equilibria of the three games.A generalization of two-player quantization scheme to a three-player Prisoners Dilemma game under the ect of correlated noise is also presented.In a restricted game scenario, it is shown the quantumplayer is always better; for all values of the decoherence parameter for the entire range of memory parameter.It is seen that for maximum degree of correlation, the game does not become \nnoiseless and quantum player can still outscore the classical players for the entire range of the decoherence parameter producing an interesting result in comparison with a two-player quantum game.It is also shown that correlated noise has not on the Nash equilibrium of the game.By exploiting the three-player quantization scheme, we have studiedthe communication aspects of a three-player Prisoner Dilemma quantum game. It is shown that entanglement plays a dominant role in a three-player quantum game.On the baois of initial state and the measurement basis entanglement parameters, a relation among different pay is established.It is investigated that the strategies of the players act as information carriers in quantum games. A relationship for the information shared among the parties is also established.A scheme for quantum key distribution is proposed in which a secret key can be generated from the data coming through a partially entanglement breaking channel.This scheme is rather deterministic andcient in the sense that two classical bits can be transferred \nper entangled pair of qubits.Furthermore, it is important to point out that, in this scheme, same symbol can be used for Eve detection and key generation. It is also worth noting that the eavesdropper, Eve, can be detected very easily from the disturbance of the elements of the decoding bimatrix. We have checked for the \nsecurity of the scheme and found it secure against individual attacks.It is further investigated that quantum games are useful in developing quantum cryptographic protocols.A multiparty quantum cryptographic protocol using tripartite entangled GHZ states is devised using game-theoretic techniques.In this protocol, two classical bits can be transferred per entangled pair of qubits to the communicating parties.Unitary operators applied by the sender on a tripartite entangled state encodes a classical symbol that can be decoded at receiver end with the help of a decoding matrix. In this protocol, if Eve interferes during the transmission, she can be detected by the disturbance of the decoding matrix. Our security analysis shows that this protocol is also secure against intercept/re-send attacks.