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:2212.03212 · Physical Review A

Tight Bell inequalities from polytope slices

José Jesus, Emmanuel Zambrini Cruzeiro

Published Nov 27, 2023• 6 citations
arXivHTMLPDF

Abstract

We derive tight bipartite Bell inequalities for various scenarios. A bipartite Bell scenario $(X,Y,A,B)$ is defined by the numbers of settings and outcomes per party, $X,A$, and $Y,B$ for Alice and Bob, respectively. We derive the complete set of facets of the local polytopes of (6,3,2,2), (3,3,3,2), (3,2,3,3), and (2,2,3,5). We provide extensive lists of facets for (2,2,4,4), (3,3,4,2), and (4,3,3,2). For each inequality we compute the maximum quantum violation, the resistance to noise, and the minimal symmetric detection efficiency required to close the detection loophole, for qubits, qutrits, and ququarts. Based on these results, we identify scenarios which perform better in terms of visibility, resistance to noise, or both, when compared to the Clauser-Horne-Shimony-Holt inequality. Such scenarios could find important applications in quantum communication.

DOI
10.1103/physreva.108.052220

Related papers

Bell inequalities from outcome equalities

Ricardo Faleiro, Flavien Hirsch, Emmanuel Zambrini Cruzeiro +1 more

In this work, we study a particular class of Bell inequalities involving only direct equality-comparisons of outcomes. In the bipartite case, the scenario can be interpreted as a natural generalization of full-correlator in- equalities (XOR games) beyond binary outputs. We define the sub-polytope of the local polytope corresponding to this scenario and solve it for several bipartite and multipartite scenarios by leveraging some structural prop- erties. In doing so, we obtain thousands of new tight inequalities, many of which are also facets of the standard local polytope. We also define unanimous Bell inequalities, a particular case of the previous class applied to the multipartite setting in which only full-equality events (all outcomes equal) are considered. We show that such inequalities can always be written as deterministic nonlocal games, and we give a simple multipartite unanimous family and prove its local bound. We show that most of these inequalities admit quantum violations, and we also display aspects of their importance for nonlocality. For instance, we identify examples where such inequalities can act as dimension witnesses, outcome witnesses, witnesses of genuine multipartite nonlocality, as well as being relevant to CHSH. These results show that these simple and elegant inequalities by themselves provide a powerful tool for discovering new Bell inequalities and device-independent witnesses.

quant-pharXiv:2603.17030•Physical Review A•Mar 19, 2026•1 citation

Complete list of tight Bell inequalities for two parties with four binary settings

Emmanuel Zambrini Cruzeiro, Nicolas Gisin

We give the complete list of 175 facets of the local polytope for the case where Alice and Bob each choose their measurements from a set of four binary outcome measurements. For each inequality we compute the maximum quantum violation for qubits, the resistance to noise, and the minimal detection efficiency required for closing the detection loophole with maximally entangled qubit states, in the case where both detectors have the same efficiency (symmetric case).

arXiv:1811.11820•Physical Review A•Feb 5, 2019•18 citations

Minimal scenario facet Bell inequalities for multi-qubit states

Arpan Das, Chandan Datta, Pankaj Agrawal

Facet inequalities play an important role in detecting the nonlocality of a quantum state. The number of such inequalities depends on the Bell test scenario. With the increase in the number of parties, measurement outcomes, or/and the number of measurement settings, there are more nontrivial facet inequalities. For several Bell scenarios, by involving two dichotomic measurement settings for two parties and one dichotomic measurement by other parties, we show that the local polytope has only one nontrivial facet. For three parties, we have three variants of this inequality, depending upon which party is doing one dichotomic measurement. This measurement scenario for a multipartite state may be considered as the minimal scenario involving multipartite correlations that can detect nonlocality. We show that this inequality is violated by all generalized GHZ states. Being the only facet Bell inequality, this inequality is also violated by any entangled three-qubit pure state. We also show that for noisy [Formula: see text] states, our inequality is more effective than the well-known Mermin inequality.

arXiv:1809.05727•International Journal of Quantum Information•Jan 3, 2023•4 citations

Tightness of correlation inequalities with no quantum violation

Ravishankar Ramanathan, Marco Túlio Quintino, Ana Belén Sainz +2 more

We study the faces of the set of quantum correlations, i.e., the Bell and noncontextuality inequalities without any quantum violation. First, we investigate the question of whether every proper (facet-defining) Bell inequality for two parties, other than the trivial ones from positivity, normalization, and no-signaling, can be violated by quantum correlations, i.e., whether the classical Bell polytope or the smaller correlation polytope share any facets with their respective quantum sets. To do this, we develop a recently derived bound on the quantum value of linear games based on the norms of game matrices to give a simple sufficient condition to identify linear games with no quantum advantage. Additionally we show how this bound can be extended to the general class of unique games. We then show that the paradigmatic examples of correlation Bell inequalities with no quantum violation, namely the nonlocal computation games, do not constitute facet-defining Bell inequalities, not even for the correlation polytope. We also extend this to an arbitrary prime number of outcomes for a specific class of these games. We then study the faces in the simplest Clauser-Horne-Shimony-Holt Bell scenario of binary dichotomic measurements, and identify edges in the set of quantum correlations in this scenario. Finally, we relate the noncontextual polytope of single-party correlation inequalities with the cut polytope $\text{CUT}(\mathbf{\ensuremath{\nabla}}G)$, where $G$ denotes the compatibility graph of observables in the contextuality scenario and $\mathbf{\ensuremath{\nabla}}G$ denotes the suspension graph of $G$. We observe that there exist facet-defining noncontextuality inequalities with no quantum violation, and furthermore that this set of inequalities is beyond those implied by the consistent exclusivity principle.

arXiv:1607.05714•Physical Review A•Jan 27, 2017•9 citations

Optimizing quantum violation for multipartite facet Bell inequalities

Jin-Fu Chen, Mengyao Hu, Jordi Tura

Nonlocality shapes quantum correlations, revealed through the violation of Bell inequalities. The intersection of all valid Bell inequalities is the so-called local polytope. In multipartite systems, characterizing the local polytope quickly becomes an intractable task as the system size increases. Optimizing Bell inequalities to maximize the ratio between their quantum value and classical bound is key to understanding multipartite nonlocality. We propose a gradient-based method for this optimization. Numerical results indicate that local maxima of this ratio typically correspond to facet Bell inequalities of the local polytope. This enables an iterative search for tight and robust Bell inequalities. Applied to permutation-invariant scenarios, the method provides tight Bell inequalities with large quantum violations and facilitates experimental certification of Bell correlations without full knowledge of the local polytope. Moreover, analytical results of the maximum ratio are derived in the thermodynamic limit.

quant-pharXiv:2511.07523•Nov 12, 2025•2 citations

All tight correlation Bell inequalities have quantum violations

Llorenç Escolà-Farràs, John Calsamiglia, Andreas Winter

The authors show that tight Bell inequalities always have a quantum violation for any bipartite setting of binary measurements. Operationally, this means that all tight XOR game inequalities can be used to test local realism. In geometric terms, the result shows that any correlation Bell inequality for which the classical and quantum values coincide, does not define a facet of the Bell polytope.

arXiv:1908.06669•Physical Review Research•Feb 24, 2020•8 citations
We derive tight bipartite Bell inequalities for various scenarios. A bipartite Bell scenario (X,Y,A,B)(X,Y,A,B)(X,Y,A,B) is defined by the numbers of settings and outcomes per party, X,AX,AX,A, and Y,BY,BY,B for Alice and Bob, respectively. We derive the complete set of facets of the local polytopes of (6,3,2,2), (3,3,3,2), (3,2,3,3), and (2,2,3,5). We provide extensive lists of facets for (2,2,4,4), (3,3,4,2), and (4,3,3,2). For each inequality we compute the maximum quantum violation, the resistance to noise, and the minimal symmetric detection efficiency required to close the detection loophole, for qubits, qutrits, and ququarts. Based on these results, we identify scenarios which perform better in terms of visibility, resistance to noise, or both, when compared to the Clauser-Horne-Shimony-Holt inequality. Such scenarios could find important applications in quantum communication.
In this work, we study a particular class of Bell inequalities involving only direct equality-comparisons of outcomes. In the bipartite case, the scenario can be interpreted as a natural generalization of full-correlator in- equalities (XOR games) beyond binary outputs. We define the sub-polytope of the local polytope corresponding to this scenario and solve it for several bipartite and multipartite scenarios by leveraging some structural prop- erties. In doing so, we obtain thousands of new tight inequalities, many of which are also facets of the standard local polytope. We also define unanimous Bell inequalities, a particular case of the previous class applied to the multipartite setting in which only full-equality events (all outcomes equal) are considered. We show that such inequalities can always be written as deterministic nonlocal games, and we give a simple multipartite unanimous family and prove its local bound. We show that most of these inequalities admit quantum violations, and we also display aspects of their importance for nonlocality. For instance, we identify examples where such inequalities can act as dimension witnesses, outcome witnesses, witnesses of genuine multipartite nonlocality, as well as being relevant to CHSH. These results show that these simple and elegant inequalities by themselves provide a powerful tool for discovering new Bell inequalities and device-independent witnesses.
Facet inequalities play an important role in detecting the nonlocality of a quantum state. The number of such inequalities depends on the Bell test scenario. With the increase in the number of parties, measurement outcomes, or/and the number of measurement settings, there are more nontrivial facet inequalities. For several Bell scenarios, by involving two dichotomic measurement settings for two parties and one dichotomic measurement by other parties, we show that the local polytope has only one nontrivial facet. For three parties, we have three variants of this inequality, depending upon which party is doing one dichotomic measurement. This measurement scenario for a multipartite state may be considered as the minimal scenario involving multipartite correlations that can detect nonlocality. We show that this inequality is violated by all generalized GHZ states. Being the only facet Bell inequality, this inequality is also violated by any entangled three-qubit pure state. We also show that for noisy [Formula: see text] states, our inequality is more effective than the well-known Mermin inequality.
We study the faces of the set of quantum correlations, i.e., the Bell and noncontextuality inequalities without any quantum violation. First, we investigate the question of whether every proper (facet-defining) Bell inequality for two parties, other than the trivial ones from positivity, normalization, and no-signaling, can be violated by quantum correlations, i.e., whether the classical Bell polytope or the smaller correlation polytope share any facets with their respective quantum sets. To do this, we develop a recently derived bound on the quantum value of linear games based on the norms of game matrices to give a simple sufficient condition to identify linear games with no quantum advantage. Additionally we show how this bound can be extended to the general class of unique games. We then show that the paradigmatic examples of correlation Bell inequalities with no quantum violation, namely the nonlocal computation games, do not constitute facet-defining Bell inequalities, not even for the correlation polytope. We also extend this to an arbitrary prime number of outcomes for a specific class of these games. We then study the faces in the simplest Clauser-Horne-Shimony-Holt Bell scenario of binary dichotomic measurements, and identify edges in the set of quantum correlations in this scenario. Finally, we relate the noncontextual polytope of single-party correlation inequalities with the cut polytope $\text{CUT}(\mathbf{\ensuremath{\nabla}}G)$, where GGG denotes the compatibility graph of observables in the contextuality scenario and $\mathbf{\ensuremath{\nabla}}G$ denotes the suspension graph of GGG. We observe that there exist facet-defining noncontextuality inequalities with no quantum violation, and furthermore that this set of inequalities is beyond those implied by the consistent exclusivity principle.
Nonlocality shapes quantum correlations, revealed through the violation of Bell inequalities. The intersection of all valid Bell inequalities is the so-called local polytope. In multipartite systems, characterizing the local polytope quickly becomes an intractable task as the system size increases. Optimizing Bell inequalities to maximize the ratio between their quantum value and classical bound is key to understanding multipartite nonlocality. We propose a gradient-based method for this optimization. Numerical results indicate that local maxima of this ratio typically correspond to facet Bell inequalities of the local polytope. This enables an iterative search for tight and robust Bell inequalities. Applied to permutation-invariant scenarios, the method provides tight Bell inequalities with large quantum violations and facilitates experimental certification of Bell correlations without full knowledge of the local polytope. Moreover, analytical results of the maximum ratio are derived in the thermodynamic limit.