4 research outputs found
Bell inequalities from variable elimination methods
Tight Bell inequalities are facets of Pitowsky's correlation polytope and are
usually obtained from its extreme points by solving the hull problem. Here we
present an alternative method based on a combination of algebraic results on
extensions of measures and variable elimination methods, e.g., the
Fourier-Motzkin method. Our method is shown to overcome some of the
computational difficulties associated with the hull problem in some non-trivial
cases. Moreover, it provides an explanation for the arising of only a finite
number of families of Bell inequalities in measurement scenarios where one
experimenter can choose between an arbitrary number of different measurements
On the Relationship between Convex Bodies Related to Correlation Experiments with Dichotomic Observables
In this paper we explore further the connections between convex bodies
related to quantum correlation experiments with dichotomic variables and
related bodies studied in combinatorial optimization, especially cut polyhedra.
Such a relationship was established in Avis, Imai, Ito and Sasaki (2005 J.
Phys. A: Math. Gen. 38 10971-87) with respect to Bell inequalities. We show
that several well known bodies related to cut polyhedra are equivalent to
bodies such as those defined by Tsirelson (1993 Hadronic J. S. 8 329-45) to
represent hidden deterministic behaviors, quantum behaviors, and no-signalling
behaviors. Among other things, our results allow a unique representation of
these bodies, give a necessary condition for vertices of the no-signalling
polytope, and give a method for bounding the quantum violation of Bell
inequalities by means of a body that contains the set of quantum behaviors.
Optimization over this latter body may be performed efficiently by semidefinite
programming. In the second part of the paper we apply these results to the
study of classical correlation functions. We provide a complete list of tight
inequalities for the two party case with (m,n) dichotomic observables when
m=4,n=4 and when min{m,n}<=3, and give a new general family of correlation
inequalities.Comment: 17 pages, 2 figure
A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
We are interested in the problem of characterizing the correlations that
arise when performing local measurements on separate quantum systems. In a
previous work [Phys. Rev. Lett. 98, 010401 (2007)], we introduced an infinite
hierarchy of conditions necessarily satisfied by any set of quantum
correlations. Each of these conditions could be tested using semidefinite
programming. We present here new results concerning this hierarchy. We prove in
particular that it is complete, in the sense that any set of correlations
satisfying every condition in the hierarchy has a quantum representation in
terms of commuting measurements. Although our tests are conceived to rule out
non-quantum correlations, and can in principle certify that a set of
correlations is quantum only in the asymptotic limit where all tests are
satisfied, we show that in some cases it is possible to conclude that a given
set of correlations is quantum after performing only a finite number of tests.
We provide a criterion to detect when such a situation arises, and we explain
how to reconstruct the quantum states and measurement operators reproducing the
given correlations. Finally, we present several applications of our approach.
We use it in particular to bound the quantum violation of various Bell
inequalities.Comment: 33 pages, 2 figure