Two-Party Bell Inequalities Derived from Combinatorics via Triangular Elimination
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.
Keywords
Cite
@article{arxiv.quant-ph/0505060,
title = {Two-Party Bell Inequalities Derived from Combinatorics via Triangular Elimination},
author = {David Avis and Hiroshi Imai and Tsuyoshi Ito and Yuuya Sasaki},
journal= {arXiv preprint arXiv:quant-ph/0505060},
year = {2015}
}
Comments
Part of results in Section 2 appeared in quant-ph/0404014, but this paper gives new proofs using only elementary mathematics. The results in Section 3 was presented in EQIS'04, Kyoto, Sept. 2004. 20 pages with 2 figures. Submitted to Journal of Physics A. v2: introduction rewritten, typos corrected, some detail of proof of Th 2.1 added, relation to open problems mentioned in concluding remarks. v3: URL of the page containing list of Bell inequalities and program to produce it added, typos corrected