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:2511.07523

Optimizing quantum violation for multipartite facet Bell inequalities

Jin-Fu Chen, Mengyao Hu, Jordi Tura

quant-phSubmitted Nov 10, 2025• Announced Nov 12, 2025• 0 citations
v1 · Nov 10, 2025v2 · Jan 18, 2026
arXivHTMLPDF

Abstract

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.

Comments
6+8 pages, 2+2 figures, comments are welcomed

Related papers

Optimizing and Certifying Multipartite Permutationally Invariant Bell Inequalities

Jin-Fu Chen, Mengyao Hu, Jordi Tura

Multipartite Bell nonlocality provides a device-independent probe of many-body quantum correlations, but its characterization is limited by the rapid growth of the underlying classical and quantum optimization problems. We develop a scalable method for constructing and certifying permutationally invariant Bell inequalities using only one- and two-body correlators. The construction gives families of inequalities with robust quantum violations for general $m$ measurements as the number of parties $N$ becomes large. To improve robustness against noise, we optimize the ratio of the quantum value to the classical bound for these families in the large-$N$ limit. We then certify the resulting quantum violation using semidefinite programming. For the broad class of Bell inequalities studied here, the infinite-$N$ ratios take simple rational values for finite $m$ and converge to $\coth(1)$ as $m\to\infty$. The optimized inequalities efficiently detect many-body Bell nonlocality with collective measurements, with more measurement settings leading to stronger violations.

quant-pharXiv:2607.08462•Jul 10, 2026•0 citations

New Facet Bell inequalities for multi-qubit states

Arpan Das, Chandan Datta, Pankaj Agrawal

Non-trivial facet inequalities play important role in detecting and quantifying the nonolocality of a state -- specially a pure state. Such inequalities are expected to be tight. Number of such inequalities depends on the Bell test scenario. With the increase in the number of parties, dimensionality of the Hilbert space, or/and the number of measurements, there are more nontrivial facet inequalities. By considering a specific measurement scenario, we find that for any multipartite qubit state, local polytope can have only one nontrivial facet. Therefore there exist a possibility that only one Bell inequality, and its permutations, would be able to detect the nonlocality of a pure state. The scenario involves two dichotomic measurement settings for two parties and one dichotomic measurement by other parties. This measurement scenario for a multipartite state may be considered as minimal scenario involving multipartite correlations that can detect nonlocality. We present detailed results for three-qubit states.

•Sep 15, 2018•0 citations

Violation of all two-party facet Bell inequalities by almost-quantum correlations

Ravishankar Ramanathan

The characterization of the set of quantum correlations is a problem of fundamental importance in quantum information. The question whether every proper (tight) Bell inequality is violated in quantum theory is an intriguing one in this regard. Here we make significant progress in answering this question, by showing that every tight Bell inequality is violated by ``almost-quantum'' correlations, a semidefinite programming relaxation of the set of quantum correlations. As a consequence, we show that many (classes of) Bell inequalities including two-party correlation Bell inequalities and multioutcome nonlocal computation games, which do not admit quantum violations, are not facets of the classical Bell polytope. To do this, we make use of the intriguing connections between Bell correlations and the graph-theoretic Lov\'asz-theta set, discovered by Cabello-Severini-Winter (CSW). We also exploit connections between the cut polytope of graph theory and the classical correlation Bell polytope, to show that correlation Bell inequalities that define facets of the lower dimensional correlation polytope are violated in quantum theory.

arXiv:2004.07673•Physical Review Research•Jul 29, 2021•4 citations

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•0 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•2 citations

Tight Bell inequalities from polytope slices

José Jesus, Emmanuel Zambrini Cruzeiro

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.

arXiv:2212.03212•Physical Review A•Nov 27, 2023•4 citations
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.
Multipartite Bell nonlocality provides a device-independent probe of many-body quantum correlations, but its characterization is limited by the rapid growth of the underlying classical and quantum optimization problems. We develop a scalable method for constructing and certifying permutationally invariant Bell inequalities using only one- and two-body correlators. The construction gives families of inequalities with robust quantum violations for general mmm measurements as the number of parties NNN becomes large. To improve robustness against noise, we optimize the ratio of the quantum value to the classical bound for these families in the large-NNN limit. We then certify the resulting quantum violation using semidefinite programming. For the broad class of Bell inequalities studied here, the infinite-NNN ratios take simple rational values for finite mmm and converge to coth⁡(1)\coth(1)coth(1) as m→∞m\to\inftym→∞. The optimized inequalities efficiently detect many-body Bell nonlocality with collective measurements, with more measurement settings leading to stronger violations.
Non-trivial facet inequalities play important role in detecting and quantifying the nonolocality of a state -- specially a pure state. Such inequalities are expected to be tight. Number of such inequalities depends on the Bell test scenario. With the increase in the number of parties, dimensionality of the Hilbert space, or/and the number of measurements, there are more nontrivial facet inequalities. By considering a specific measurement scenario, we find that for any multipartite qubit state, local polytope can have only one nontrivial facet. Therefore there exist a possibility that only one Bell inequality, and its permutations, would be able to detect the nonlocality of a pure state. The scenario involves two dichotomic measurement settings for two parties and one dichotomic measurement by other parties. This measurement scenario for a multipartite state may be considered as minimal scenario involving multipartite correlations that can detect nonlocality. We present detailed results for three-qubit states.
The characterization of the set of quantum correlations is a problem of fundamental importance in quantum information. The question whether every proper (tight) Bell inequality is violated in quantum theory is an intriguing one in this regard. Here we make significant progress in answering this question, by showing that every tight Bell inequality is violated by ``almost-quantum'' correlations, a semidefinite programming relaxation of the set of quantum correlations. As a consequence, we show that many (classes of) Bell inequalities including two-party correlation Bell inequalities and multioutcome nonlocal computation games, which do not admit quantum violations, are not facets of the classical Bell polytope. To do this, we make use of the intriguing connections between Bell correlations and the graph-theoretic Lov\'asz-theta set, discovered by Cabello-Severini-Winter (CSW). We also exploit connections between the cut polytope of graph theory and the classical correlation Bell polytope, to show that correlation Bell inequalities that define facets of the lower dimensional correlation polytope are violated in quantum theory.
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 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.