Full-correlation Bell-like inequalities represent an important subclass of Bell-like inequalities that have found applications in both a better understanding of fundamental physics and in quantum information science. Loosely speaking, these are inequalities where only measurement statistics involving all parties play a role. In this paper, we provide a framework for the study of a large family of such inequalities that are symmetrical with respect to arbitrary permutations of the parties. As an illustration of the power of our framework, we derive (i) a new family of Svetlichny inequalities for arbitrary numbers of parties, settings and outcomes, (ii) a new family of two-outcome device-independent entanglement witnesses for genuine n -partite entanglement and (iii) a new family of two-outcome Tsirelson inequalities for arbitrary numbers of parties and settings. We also discuss briefly the application of these new inequalities in the characterization of quantum correlations.
Full-correlation Bell-like inequalities represent an important subclass of Bell-like inequalities that have found applications in both a better understanding of fundamental physics and in quantum information science. Loosely speaking, these are inequalities where only measurement statistics involving all parties play a role. In this paper, we provide a framework for the study of a large family of such inequalities that are symmetrical with respect to arbitrary permutations of the parties. As an illustration of the power of our framework, we derive (i) a new family of Svetlichny inequalities for arbitrary numbers of parties, settings and outcomes, (ii) a new family of two-outcome device-independent entanglement witnesses for genuine n -partite entanglement and (iii) a new family of two-outcome Tsirelson inequalities for arbitrary numbers of parties and settings. We also discuss briefly the application of these new inequalities in the characterization of quantum correlations.
Finding all Bell inequalities for a given number of parties, measurement settings and measurement outcomes is in general a computationally hard task. We show that all Bell inequalities which are symmetric under the exchange of parties can be found by examining a symmetrized polytope which is simpler than the full Bell polytope. As an illustration of our method, we generate 238 885 new Bell inequalities and 1085 new Svetlichny inequalities. We find, in particular, facet inequalities for Bell experiments involving two parties and two measurement settings that are not of the Collins–Gisin–Linden–Massar–Popescu type.
We present a simple family of Bell inequalities applicable to a scenario involving arbitrarily many parties, each of which performs two binary-outcome measurements. We show that these inequalities are members of the complete set of full-correlation Bell inequalities discovered by Werner-Wolf-Żukowski-Brukner. For scenarios involving a small number of parties, we further verify that these inequalities are facet defining for the convex set of Bell-local correlations. Moreover, we show that the amount of quantum violation of these inequalities naturally manifests the extent to which the underlying system is genuinely many-body entangled. In other words, our Bell inequalities, when supplemented with the appropriate quantum bounds, naturally serve as device-independent witnesses for entanglement depth, allowing one to certify genuine k-partite entanglement in an arbitrary n≥k-partite scenario without relying on any assumption about the measurements being performed, or the dimension of the underlying physical system. A brief comparison is made between our witnesses and those based on some other Bell inequalities, as well as quantum Fisher information. A family of witnesses for genuine k-partite nonlocality applicable to an arbitrary n≥k-partite scenario based on our Bell inequalities is also presented.
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.
The structure of Bell-type inequalities detecting genuine multipartite nonlocality, and hence detecting genuine multipartite entanglement, is investigated. We first present a simple and intuitive approach to Svetlichny's original inequality, which provides a clear understanding of its structure and of its violation in quantum mechanics. Based on this approach, we then derive a family of Bell-type inequalities for detecting genuine multipartite nonlocality in scenarios involving an arbitrary number of parties and systems of arbitrary dimension. Finally, we discuss the tightness and quantum mechanical violations of these inequalities.
Investigations of the boundary of the quantum correlation set have gained increased attention in recent years. This is done through the derivation of quantum Bell inequalities, which are related to Tsirelson's problem and have significant applications in device-independent (DI) information processing. However, determining quantum Bell inequalities is a notoriously difficult task and only isolated examples are known. In this paper, we present families of (almost-)quantum Bell inequalities and highlight four foundational and DI applications. Firstly, it is known that quantum correlations on the non-signaling boundary are of crucial importance in the task of DI randomness extraction from weak sources. In the practical Bell scenario of two players with two k -outcome measurements, we derive quantum Bell inequalities that demonstrate a separation between the quantum boundary and certain portions of the boundaries of the no-signaling polytope of dimension up to 4k−8 , extending previous results from nonlocality distillation and the collapse of communication complexity. Secondly as an immediate by-product, we give a general proof of Aumann’s Agreement theorem for quantum systems as well as the almost-quantum correlations, which implies Aumann’s agreement theorem is a reasonable physical principle in the context of epistemics to pick out both quantum theory and almost-quantum correlations from general no-signaling theories. Thirdly, we present a family of quantum Bell inequalities in the two players with m binary measurements scenarios, that we prove serve to self-test the two-qubit singlet and the corresponding 2m measurements. Interestingly, this claim generalizes the result for m=2 discovered by Tsirelson-Landau-Masanes and shows an improvement over the state-of-the-art Device-Independent Randomness-Amplification (DIRA). Lastly, we use our quantum Bell inequalities to derive the general form of the principle of no advantage in nonlocal computation, which is an information-theoretic principle that serves to characterize the quantum correlation set.
When three or more particles are considered, quantum correlations can be stronger than the correlations generated by so-called hybrid local hidden variable models, where some of the particles are considered as a single block inside which communication and signaling is allowed. We provide an exhaustive classification of Bell inequalities to characterize various hybrid scenarios in four- and five-particle systems. In quantum mechanics, these inequalities provide device-independent witnesses for the entanglement depth. In addition, we construct a family of inequalities to detect a nonlocality depth of $(n\ensuremath{-}1)$ in n-particle systems. Moreover, we present two generalizations of the original Svetlichny inequality, which was the first Bell inequality designed for hybrid models. Our results are based on the cone-projection technique, which can be used to completely characterize Bell inequalities under affine constraints; even for many parties, measurements, and outcomes.