Geometric Decompositions of Bell Polytopes with Practical Applications
Peter Bierhorst

TL;DR
This paper provides a detailed geometric decomposition of Bell polytopes in the (2,2,2) scenario, offering new insights into nonlocality detection, efficient data analysis algorithms, and extending results to chained Bell scenarios.
Contribution
It introduces a unique convex decomposition of nonlocal distributions into PR boxes and local deterministic distributions, and applies this to improve nonlocality detection and analyze chained Bell scenarios.
Findings
Nonlocal distributions can be uniquely decomposed with a fixed PR box and local deterministic distributions.
The minimum detection efficiency for observing nonlocality is proven to be greater than 2/3.
New algorithms are developed for faster statistical analysis of Bell test data.
Abstract
In the well-studied (2,2,2) Bell experiment consisting of two parties, two measurement settings per party, and two possible outcomes per setting, it is known that if the experiment obeys no-signaling constraints, then the set of admissible experimental probability distributions is fully characterized as the convex hull of 24 distributions: 8 Popescu-Rohrlich (PR) boxes and 16 local deterministic distributions. Here, we refine this result to show that in the (2,2,2) case, any nonlocal nonsignaling distribution can always be uniquely expressed as a convex combination of exactly one PR box and (up to) eight local deterministic distributions. In this representation each PR box will always occur only with a fixed set of eight local deterministic distributions with which it is affiliated. This decomposition has multiple applications: we demonstrate an analytical proof that the minimum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
