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:0803.0579 · Physics Letters A

Equivalence between Bell inequalities and quantum minority games

Adrian P. Flitney, Maximilian Schlosshauer, Christian Schmid, Wiesław Laskowski, Lloyd C. L. Hollenberg

Published Dec 9, 2008• 21 citations
arXivHTMLPDF
DOI
10.1016/j.physleta.2008.12.003

Related papers

The equivalence of Bell's inequality and the Nash inequality in a quantum game-theoretic setting

Azhar Iqbal, James M. Chappell, Derek Abbott

arXiv:1507.07341•Physics Letters A•Aug 14, 2018•8 citations

Constructing quantum games from a system of Bell's inequalities

Azhar Iqbal, Derek Abbott

arXiv:0909.3369•Physics Letters A•May 26, 2010•26 citations

On the relation between Bell's inequalities and nonlocal games

Jonathan Silman, Shai Machnes, N. Aharon

arXiv:0710.3322•Physics Letters A•Mar 12, 2008•27 citations

Quantum minority game utilizing various forms of entanglement

Adrian P. Flitney, Lloyd C. L. Hollenberg

The quantum Minority game provides a means of studying the effect of multi-partite entanglement in a game theoretic setting. We study symmetric Nash equilibria and symmetric Pareto optimal strategies arising in a four-player quantum Minority game that uses an initial state that is a superposition of a GHZ state and products of EPR pairs. We find that the payoff curve for the symmetric Pareto optimal strategy is the same as that for the maximal violation of the Mermin-Ardehali-Belinskii-Klyshko inequality for the initial state, indicating a correspondence between quantum game theory and Bell inequalities. We also show that no advantage over the classical Minority game can be obtained when the initial state has only two party entanglement.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Dec 3, 2007•4 citations

Bell nonlocality with a single shot

Mateus Araújo, Flavien Hirsch, Marco Túlio Quintino

In order to reject the local hidden variables hypothesis, the usefulness of a Bell inequality can be quantified by how small a p -value it will give for a physical experiment. Here we show that to obtain a small expected p -value it is sufficient to have a large gap between the local and Tsirelson bounds of the Bell inequality, when it is formulated as a nonlocal game. We develop an algorithm for transforming an arbitrary Bell inequality into an equivalent nonlocal game with the largest possible gap, and show its results for the CGLMP and Inn22 inequalities.We present explicit examples of Bell inequalities with gap arbitrarily close to one, and show that this makes it possible to reject local hidden variables with arbitrarily small p -value in a single shot, without needing to collect statistics. We also develop an algorithm for calculating local bounds of general Bell inequalities which is significantly faster than the naïve approach, which may be of independent interest.

arXiv:2005.13418•Quantum•Oct 28, 2020•25 citations

Linear game non-contextuality and Bell inequalities - a graph-theoretic approach

P. Gnaciński, Monika Rosicka, Ravishankar Ramanathan +4 more

We study the classical and quantum values of one- and two-party linear games, an important class of unique games that generalizes the well-known XOR games to the case of non-binary outcomes. We introduce a ``constraint graph" associated to such a game, with the constraints defining the linear game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of more general XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. Linear games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite linear game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions.

arXiv:1511.05415•Nov 17, 2015•2 citations
The quantum Minority game provides a means of studying the effect of multi-partite entanglement in a game theoretic setting. We study symmetric Nash equilibria and symmetric Pareto optimal strategies arising in a four-player quantum Minority game that uses an initial state that is a superposition of a GHZ state and products of EPR pairs. We find that the payoff curve for the symmetric Pareto optimal strategy is the same as that for the maximal violation of the Mermin-Ardehali-Belinskii-Klyshko inequality for the initial state, indicating a correspondence between quantum game theory and Bell inequalities. We also show that no advantage over the classical Minority game can be obtained when the initial state has only two party entanglement.
In order to reject the local hidden variables hypothesis, the usefulness of a Bell inequality can be quantified by how small a p -value it will give for a physical experiment. Here we show that to obtain a small expected p -value it is sufficient to have a large gap between the local and Tsirelson bounds of the Bell inequality, when it is formulated as a nonlocal game. We develop an algorithm for transforming an arbitrary Bell inequality into an equivalent nonlocal game with the largest possible gap, and show its results for the CGLMP and Inn22 inequalities.We present explicit examples of Bell inequalities with gap arbitrarily close to one, and show that this makes it possible to reject local hidden variables with arbitrarily small p -value in a single shot, without needing to collect statistics. We also develop an algorithm for calculating local bounds of general Bell inequalities which is significantly faster than the naïve approach, which may be of independent interest.
We study the classical and quantum values of one- and two-party linear games, an important class of unique games that generalizes the well-known XOR games to the case of non-binary outcomes. We introduce a ``constraint graph" associated to such a game, with the constraints defining the linear game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of more general XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. Linear games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite linear game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions.