Two-party Bell inequalities derived from combinatorics via triangular elimination

@article{Avis2005TwopartyBI,
  title={Two-party Bell inequalities derived from combinatorics via triangular elimination},
  author={D. Avis and H. Imai and T. Ito and Y. Sasaki},
  journal={Journal of Physics A},
  year={2005},
  volume={38},
  pages={10971-10987}
}
  • D. Avis, H. Imai, +1 author Y. Sasaki
  • Published 2005
  • Mathematics, Physics
  • Journal of Physics A
  • We establish a relation between the two-party Bell inequalities for two-valued measurements and a high-dimensional convex polytope called the cut polytope in polyhedral combinatorics. Using this relation, we propose a method, triangular elimination, to derive tight Bell inequalities from facets of the cut polytope. This method gives two hundred million inequivalent tight Bell inequalities from currently known results on the cut polytope. In addition, this method gives general formulae which… CONTINUE READING
    38 Citations

    Figures and Tables from this paper

    Bell inequalities from variable-elimination methods
    • 15
    • PDF
    High-dimension Bell inequalities
    Looking for symmetric Bell inequalities
    • 46
    • PDF
    Generating facets for the cut polytope of a graph by triangular elimination
    • 11
    • PDF
    Leggett-Garg inequalities and the geometry of the cut polytope
    • 38
    • PDF
    Polyhedral and semidefinite approaches to classical and quantum Bell inequalities
    • PDF
    Classifying 50 years of Bell inequalities
    • 37
    • PDF
    On the Extension Complexity of Combinatorial Polytopes
    • 45
    • PDF

    References

    SHOWING 1-10 OF 76 REFERENCES
    Bell inequalities and entanglement
    • 208
    • PDF
    Tight Bell inequality for d-outcome measurements correlations
    • L. Masanes
    • Mathematics, Computer Science
    • Quantum Inf. Comput.
    • 2003
    • 52
    • PDF
    Correlation polytopes: Their geometry and complexity
    • I. Pitowsky
    • Mathematics, Computer Science
    • Math. Program.
    • 1991
    • 164
    Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes
    • 37
    New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities
    • D. Avis, T. Ito
    • Computer Science, Mathematics
    • Discret. Appl. Math.
    • 2007
    • 8
    • PDF
    Bell inequalities for arbitrarily high-dimensional systems.
    • 588
    • PDF
    A relevant two qubit Bell inequality inequivalent to the CHSH inequality
    • 268
    • PDF
    Lifting Bell inequalities
    • 75
    • PDF