Two-party Bell inequalities derived from combinatorics via triangular elimination

DOI10.1088/0305-4470/38/50/007zbMath1092.81508arXivquant-ph/0505060OpenAlexW3102370545MaRDI QIDQ5717829

David Avis, Yuuya Saski, Tsuyoshi Ito, Hiroshi 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 polytopepolyhedral combinatoricshigh-dimensional convex polytopetwo-party Bell inequalitiestwo-valued measurements

Mathematics Subject Classification ID

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

Related Items (15)

Looking for symmetric Bell inequalities ⋮ New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities ⋮ Generalized cut and metric polytopes of graphs and simplicial complexes ⋮ Varieties of contextuality based on probability and structural nonembeddability ⋮ On the inequivalence of the CH and CHSH inequalities due to finite statistics ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Lifting and separation procedures for the cut polytope ⋮ Causal structures from entropic information: geometry and novel scenarios ⋮ Leggett-Garg inequalities and the geometry of the cut polytope ⋮ Extending Bell inequalities to more parties ⋮ Generating facets for the cut polytope of a graph by triangular elimination ⋮ Quasi-Bell inequalities from symmetrized products of noncommuting qubit observables ⋮ On the extension complexity of combinatorial polytopes ⋮ Enumeration of the facets of cut polytopes over some highly symmetric graphs ⋮ Bipartite Bell inequalities with three ternary-outcome measurements—from theory to experiments

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