Bell Inequalities from Polyhedral Sampling

Summarize this article with:
Quantum Physics arXiv:2604.22859 (quant-ph) [Submitted on 22 Apr 2026] Title:Bell Inequalities from Polyhedral Sampling Authors:Christian Staufenbiel View a PDF of the paper titled Bell Inequalities from Polyhedral Sampling, by Christian Staufenbiel View PDF HTML (experimental) Abstract:Bell inequalities play a central role in certifying quantum correlations and underpin protocols such as device-independent quantum key distribution. However, enumerating all Bell inequalities for a given scenario remains intractable beyond the simplest cases, as it requires solving a computationally hard facet enumeration problem on the associated Bell polytope. We propose the Adjacency Sampling method, which builds on the Adjacency Decomposition method but sacrifices completeness for speed. On previously solved Bell polytopes, the method reproduces every known class of inequalities. For scenarios where no complete enumeration exists, it greatly exceeds existing partial results: in $\mathcal{L}_{3,3,3,3}$ we obtain over $1.29 \times 10^8$ classes, more than 25 times the previous count; in $\mathcal{L}_{4,5,2,2}$ we nearly triple the known list to 49\,358 classes; and for $\mathcal{L}_{4,6,2,2}$ we report over 4.3 million classes. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2604.22859 [quant-ph] (or arXiv:2604.22859v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2604.22859 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Christian Staufenbiel [view email] [v1] Wed, 22 Apr 2026 20:09:20 UTC (13 KB) Full-text links: Access Paper: View a PDF of the paper titled Bell Inequalities from Polyhedral Sampling, by Christian StaufenbielView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-04 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation ร loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
