Two-party Bell inequalities derived from combinatorics via triangular elimination

DOI10.1088/0305-4470/38/50/007MaRDI QIDQ5717829zbMATH OpenOpenAlexFDO

Authors David Avis, Tsuyoshi Ito, Yuuya Saski, Hideki Imai

Publication date 13 January 2006

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0505060

zbMATH Keywords

cut polytopehigh-dimensional convex polytopepolyhedral combinatoricstwo-party Bell inequalitiestwo-valued measurements

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Quantum measurement theory, state operations, state preparations (81P15) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Abstract: 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 formulas which represent families of infinitely many Bell inequalities. These results can be used to examine general properties of Bell inequalities.

Recommendations

• Bell inequalities from variable-elimination methods
• Bell inequalities on two classes of observables
• A relevant two qubit Bell inequality inequivalent to the CHSH inequality
• Polyhedral duality in Bell scenarios with two binary observables
• Bell inequalities versus entanglement and mixedness for a class of two-qubit states
• On tight multiparty Bell inequalities for many settings
• On Bell's theorem for N‐qubits
• Bell Inequalities, Grothendieck’s Constant, and Root Two
• A combinatorial approach to nonlocality and contextuality

Cited in

(17)

• Generalized cut and metric polytopes of graphs and simplicial complexes
• New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities
• Generating facets for the cut polytope of a graph by triangular elimination
• Varieties of contextuality based on probability and structural nonembeddability
• Enumeration of the facets of cut polytopes over some highly symmetric graphs
• Polyhedral duality in Bell scenarios with two binary observables
• Looking for symmetric Bell inequalities
• Lifting and separation procedures for the cut polytope
• Leggett-Garg inequalities and the geometry of the cut polytope
• Extending Bell inequalities to more parties
• Causal structures from entropic information: geometry and novel scenarios
• On the inequivalence of the CH and CHSH inequalities due to finite statistics
• On the relationship between convex bodies related to correlation experiments with dichotomic observables
• Quasi-Bell inequalities from symmetrized products of noncommuting qubit observables
• Bipartite Bell inequalities with three ternary-outcome measurements -- from theory to experiments
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
• Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization

This page was built for publication: Two-party Bell inequalities derived from combinatorics via triangular elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717829)