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

Chinese Control Conference (CCC)

Playing Bayesian Games with General Quantum Advice

Xiaozhen Ge, Zairong Xi

Published Jul 1, 2018• 0 citations
Publisher

Abstract

The correlations, established through quantum sources, have been demonstrated to outperform classical ones in the game theory. As shown in the game firstly proposed in [Phys. Rev. Lett. 114, 020401 (2015)], the considered conflicting Bayesian game can be converted into a common interest one and end in a better solution than all classical possible when the players share a maximally entangled state. In this paper, motivated by the possible constraints on the states in practical applications, we would like to discuss more general quantum advice and analyze the effects on the aforementioned Bayesian game.

DOI
10.23919/chicc.2018.8484000

Related papers

Playing Bayesian games better with separable quantum states than with any classical correlation

Yaqing Xy Wang, Giannicola Scarpa, Andreas Winter

Bayesian games, also known as games of incomplete information, are a fruitful arena for exploring the impact of correlations on a set of independent agents (players) via the game equilibria to which they give rise. It was realised some time ago that quantum states shared between the players can lead to new and beneficial equilibria, compared to classical correlation. While until now examples of this effect required an entangled state, here we show that even separable states can create new, genuinely quantum equilibria in games, that are advantageous with respect to all classically correlated equilibria. This shows that non-classical correlations beyond entanglement are indeed a resource, even in otherwise entirely classical situations. Our result brings quantum advantage in games significantly closer to possible realisation.

quant-pharXiv:2607.09477•Jul 13, 2026•0 citations

Strong quantum solutions in conflicting-interest Bayesian games

Ashutosh Rai, Goutam Paul

Quantum entanglement has been recently demonstrated as a useful resource in conflicting-interest games of incomplete information between two players, Alice and Bob [Pappa et al., Phys. Rev. Lett. 114, 020401 (2015)]. The general setting for such games is that of correlated strategies where the correlation between competing players is established through a trusted common adviser; however, players need not reveal their input to the adviser. So far, the quantum advantage in such games has been revealed in a restricted sense. Given a quantum correlated equilibrium strategy, one of the players can still receive a higher than quantum average payoff with some classically correlated equilibrium strategy. In this work, by considering a class of asymmetric Bayesian games, we show the existence of games with quantum correlated equilibrium where the average payoff of both the players exceeds the respective individual maximum for each player over all classically correlated equilibriums.

arXiv:1705.04639•Physical Review A•Oct 30, 2017•11 citations

Nonlocal correlations: Fair and unfair strategies in Bayesian games

Arup Roy, Amit Mukherjee, Tamal Guha +3 more

An interesting connection has been established between two apparently unrelated concepts, namely, quantum nonlocality and Bayesian game theory. It has been shown that nonlocal correlations in the form of advice can outperform classical equilibrium strategies in common-interest Bayesian games and also in conflicting-interest Bayesian games. Classical equilibrium strategies can be of two types, fair and unfair. Whereas in fair equilibrium payoffs of different players are equal, in the unfair case they differ. An advantage of nonlocal correlation has been demonstrated over fair strategies only. We show that quantum strategies can outperform even the unfair classical equilibrium strategies. For this purpose we consider a class of two-player Bayesian games. It becomes that such games can have only fair equilibria, both fair and unfair equilibria, or only unfair ones. We provide a simple analytic method to characterize the nonlocal correlations that are advantageous over the classical equilibrium strategies in these games. We also show that quantum advice provides a better social optimality solution (a relevant notion of equilibrium for the unfair case) over the classical one.

arXiv:1601.02349•Physical Review A•Sep 21, 2016•38 citations

Quantum advice enhances social optimality in three-party conflicting interest games

SituHaozhen, ZhangCai, YuFang

Quantum pseudo-telepathy games are good examples of explaining the strangeness of quantum mechanics and demonstrating the advantage of quantum resources over classical resources. Most of the quantu...

Quantum Information and Computation•May 1, 2016•0 citations

Quantum Computation and Pseudotelepathic Games

Jeffrey Bub

A quantum algorithm succeeds not because the superposition principle allows ‘the computation of all values of a function at once’ via ‘quantum parallelism’, but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information-processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I also introduce the notion of ‘pseudotelepathic’ games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players’ correlated responses in a game).

arXiv:1005.2449•Philosophy of Science•Oct 1, 2008•4 citations

On characterizing quantum correlated equilibria

Zhaohui Wei, Shengyu Zhang

Quantum game theory lays a foundation for understanding the interaction of people using quantum computers with conflicting interests. Recently Zhang proposed a simple yet rich model to study quantum strategic games, and addressed some quantitative questions for general games of growing sizes \cite{Zha10}. However, one fundamental question that the paper did not consider is the characterization of quantum correlated equilibria (QCE). In this paper, we answer this question by giving a sufficient and necessary condition for an arbitrary state $ρ$ being a QCE. In addition, when the condition fails to hold for some player $i$, we give an explicit POVM for that player to achieve a strictly positive gain. Finally, we give some upper bounds for the maximum gain by playing quantum strategies over classical ones, and the bounds are tight for some games.

arXiv:1105.5353•May 26, 2011•2 citations
The correlations, established through quantum sources, have been demonstrated to outperform classical ones in the game theory. As shown in the game firstly proposed in [Phys. Rev. Lett. 114, 020401 (2015)], the considered conflicting Bayesian game can be converted into a common interest one and end in a better solution than all classical possible when the players share a maximally entangled state. In this paper, motivated by the possible constraints on the states in practical applications, we would like to discuss more general quantum advice and analyze the effects on the aforementioned Bayesian game.
Bayesian games, also known as games of incomplete information, are a fruitful arena for exploring the impact of correlations on a set of independent agents (players) via the game equilibria to which they give rise. It was realised some time ago that quantum states shared between the players can lead to new and beneficial equilibria, compared to classical correlation. While until now examples of this effect required an entangled state, here we show that even separable states can create new, genuinely quantum equilibria in games, that are advantageous with respect to all classically correlated equilibria. This shows that non-classical correlations beyond entanglement are indeed a resource, even in otherwise entirely classical situations. Our result brings quantum advantage in games significantly closer to possible realisation.
Quantum entanglement has been recently demonstrated as a useful resource in conflicting-interest games of incomplete information between two players, Alice and Bob [Pappa et al., Phys. Rev. Lett. 114, 020401 (2015)]. The general setting for such games is that of correlated strategies where the correlation between competing players is established through a trusted common adviser; however, players need not reveal their input to the adviser. So far, the quantum advantage in such games has been revealed in a restricted sense. Given a quantum correlated equilibrium strategy, one of the players can still receive a higher than quantum average payoff with some classically correlated equilibrium strategy. In this work, by considering a class of asymmetric Bayesian games, we show the existence of games with quantum correlated equilibrium where the average payoff of both the players exceeds the respective individual maximum for each player over all classically correlated equilibriums.
An interesting connection has been established between two apparently unrelated concepts, namely, quantum nonlocality and Bayesian game theory. It has been shown that nonlocal correlations in the form of advice can outperform classical equilibrium strategies in common-interest Bayesian games and also in conflicting-interest Bayesian games. Classical equilibrium strategies can be of two types, fair and unfair. Whereas in fair equilibrium payoffs of different players are equal, in the unfair case they differ. An advantage of nonlocal correlation has been demonstrated over fair strategies only. We show that quantum strategies can outperform even the unfair classical equilibrium strategies. For this purpose we consider a class of two-player Bayesian games. It becomes that such games can have only fair equilibria, both fair and unfair equilibria, or only unfair ones. We provide a simple analytic method to characterize the nonlocal correlations that are advantageous over the classical equilibrium strategies in these games. We also show that quantum advice provides a better social optimality solution (a relevant notion of equilibrium for the unfair case) over the classical one.
A quantum algorithm succeeds not because the superposition principle allows ‘the computation of all values of a function at once’ via ‘quantum parallelism’, but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information-processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I also introduce the notion of ‘pseudotelepathic’ games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players’ correlated responses in a game).
Quantum game theory lays a foundation for understanding the interaction of people using quantum computers with conflicting interests. Recently Zhang proposed a simple yet rich model to study quantum strategic games, and addressed some quantitative questions for general games of growing sizes \cite{Zha10}. However, one fundamental question that the paper did not consider is the characterization of quantum correlated equilibria (QCE). In this paper, we answer this question by giving a sufficient and necessary condition for an arbitrary state ρρρ being a QCE. In addition, when the condition fails to hold for some player iii, we give an explicit POVM for that player to achieve a strictly positive gain. Finally, we give some upper bounds for the maximum gain by playing quantum strategies over classical ones, and the bounds are tight for some games.