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

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

URL: http://arxiv.org/abs/2607.09477v1
Date: Fri, 10 Jul 2026 14:51:06 GMT
Title: Playing Bayesian games better with separable quantum states than with any classical correlation
Abstract summary: We show that even separable states can create new, genuinely quantum equilibria in games.<n>This shows that non-classical correlations beyond entanglement are indeed a resource, even in otherwise entirely classical situations.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: 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.

Related papers

Determining Quantum Correlation through Nash Equilibria in Constant-Sum Games [0.0]
Quantum game theory has emerged as a promising candidate to further the understanding of quantum correlations. Motivated by this, it is demonstrated that pure strategy Nash equilibria can be utilised as a mechanism to witness and determine quantum correlation.
arXiv Detail & Related papers (2024-10-20T14:27:01Z)
A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover.<n>We establish a quantum soundness result for all compiled two-player nonlocal games.
arXiv Detail & Related papers (2024-08-13T08:11:56Z)
Photonic implementation of the quantum Morra game [69.65384453064829]
We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case. We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game. We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
arXiv Detail & Related papers (2023-11-14T19:41:50Z)
On the power of quantum entanglement in multipartite quantum XOR games [3.655021726150368]
In particular, quantum entanglement can be a much more powerful resource than local operations and classical communication to play these games. This result shows a strong contrast to the bipartite case, where it was recently proved that the entangled bias is always upper bounded by a universal constant times the one-way classical communication bias.
arXiv Detail & Related papers (2023-02-23T06:26:37Z)
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games [89.96815099996132]
We characterize the convergence of optimistic gradient descent (OGD) in time-varying games. Our framework yields sharp convergence bounds for the equilibrium gap of OGD in zero-sum games. We also provide new insights on dynamic regret guarantees in static games.
arXiv Detail & Related papers (2023-01-26T17:25:45Z)
How Bad is Selfish Driving? Bounding the Inefficiency of Equilibria in Urban Driving Games [64.71476526716668]
We study the (in)efficiency of any equilibrium players might agree to play. We obtain guarantees that refine existing bounds on the Price of Anarchy. Although the obtained guarantees concern open-loop trajectories, we observe efficient equilibria even when agents employ closed-loop policies.
arXiv Detail & Related papers (2022-10-24T09:32:40Z)
Learning Correlated Equilibria in Mean-Field Games [62.14589406821103]
We develop the concepts of Mean-Field correlated and coarse-correlated equilibria. We show that they can be efficiently learnt in emphall games, without requiring any additional assumption on the structure of the game.
arXiv Detail & Related papers (2022-08-22T08:31:46Z)
Entropic Accord: A new measure in the quantum correlation hierarchy [0.5039813366558306]
We show a new measure of quantum correlations which we call entropic accord that fits between entanglement and discord. We study two-qubit states which shows the relationship between the three entropic quantities.
arXiv Detail & Related papers (2022-05-13T07:16:50Z)
Multistage games and Bell scenarios with communication [0.9176056742068814]
Bell nonlocality is a cornerstone of quantum theory with applications in information processing ranging from cryptography to distributed computing and game theory. It is known that Bell's theorem can be formally linked to Bayesian games, allowing the use of nonlocal correlations to advise players and achieve new points of equilibrium that are unavailable classically. Here we generalize this link, proving the connection between multistage games of incomplete information with Bell scenarios involving the communication of measurement outcomes between the parties.
arXiv Detail & Related papers (2020-12-01T18:51:40Z)
Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond [107.14897720357631]
We show that an optimal correlated equilibrium can be computed in time in two-player games with public chance moves. This results in the biggest positive complexity result surrounding extensive-form correlation in more than a decade.
arXiv Detail & Related papers (2020-09-09T14:51:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.