Bell Inequalities from Polyhedral Sampling

• URL: http://arxiv.org/abs/2604.22859v1
• Date: Wed, 22 Apr 2026 20:09:20 GMT
• Title: Bell Inequalities from Polyhedral Sampling
• Abstract summary: enumerating Bell inequalities for a given scenario remains intractable beyond the simplest cases.<n>We propose the Adjacency Sampling method, which builds on the Adjacency Decomposition method but sacrifices for speed.<n>For scenarios where no complete enumeration exists, it greatly exceeds existing partial results.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale [54.65053906803857]
  We study the optimal scale at which real-valued function classes exhibit uniform convergence and learnability.<n>Our main result establishes a scale-sensitive generalization of the fundamental theorem of PAC learning.<n>We also highlight several open questions on quantitative sample complexity and evaluability.
  arXiv  Detail & Related papers  (2026-05-13T15:41:30Z)
• Classifying the simplest Bell inequalities beyond qubits and their applications towards self-testing [0.22399170518036918]
  Bell inequalities show gap between local and nonlocal quantum behaviour.<n>This is useful for the geometric characterisation of the set of nonlocal correlations achievable within quantum theory.<n>It provides a systematic way to construct Bell inequalities tailored to specific quantum information processing tasks.
  arXiv  Detail & Related papers  (2026-02-09T10:16:02Z)
• Optimizing quantum violation for multipartite facet Bell inequalities [2.4545951785034075]
  Nonlocality shapes quantum correlations, revealed through the violation of Bell inequalities.<n>In multipartite systems, characterizing the local polytope quickly becomes an intractable task as the system size increases.<n>We propose a gradient-based method for this optimization. Numerical results indicate that local maxima of this ratio typically correspond to facet Bell inequalities of the local polytope.
  arXiv  Detail & Related papers  (2025-11-10T19:00:02Z)
• Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noise [41.23222309589753]
  We study the task of Multiclass Linear Classification (MLC) in the distribution-free PAC model with Random Classification Noise (RCN)<n>As our main contribution, we show that the complexity of MLC with RCN becomes drastically different in the presence of three or more labels.
  arXiv  Detail & Related papers  (2025-02-17T03:54:38Z)
• Multi-qubit entanglement generation with squeezed modes [37.69303106863453]
  We present a continuous variable-discrete variable entanglement generation protocol, capable of producing multiple high-fidelity Bell pairs per protocol iteration.<n>The effectiveness of the protocol is determined by the squeezing strength. To increase the number of Bell pairs, approximately 3 dB of extra squeezing is needed for each additional Bell pair.
  arXiv  Detail & Related papers  (2024-10-24T15:26:13Z)
• Maximal Clauser-Horne-Shimony-Holt violation for qubit-qudit states [41.99844472131922]
  We evaluate the maximal Clauser-Horne-Shimony-Holt violation for a generic (typically mixed) qubit-qudit state.<n>This represents the optimal (2-2-2) Bell nonlocality for this kind of systems.
  arXiv  Detail & Related papers  (2024-04-02T16:40:57Z)
• Optimal Multi-Distribution Learning [88.3008613028333]
  Multi-distribution learning seeks to learn a shared model that minimizes the worst-case risk across $k$ distinct data distributions.<n>We propose a novel algorithm that yields an varepsilon-optimal randomized hypothesis with a sample complexity on the order of (d+k)/varepsilon2.
  arXiv  Detail & Related papers  (2023-12-08T16:06:29Z)
• Entanglement and Bell inequalities violation in $H\to ZZ$ with anomalous coupling [44.99833362998488]
  We discuss entanglement and violation of Bell-type inequalities for a system of two $Z$ bosons produced in Higgs decays. We find that a $ZZ$ state is entangled and violates the inequality for all values of the pair (anomalous) coupling constant.
  arXiv  Detail & Related papers  (2023-07-25T13:44:31Z)
• Tight Bell inequalities from polytope slices [0.0]
  We derive new tight bipartite Bell inequalities for various scenarios. We identify scenarios which perform better in terms of visibility, resistance to noise, or both, when compared to CHSH.
  arXiv  Detail & Related papers  (2022-12-06T18:35:51Z)
• Generalized Iterative Formula for Bell Inequalities [12.55611325152539]
  This work is inspired via a decomposition of $(n+1)$-partite Bell inequalities into $n$-partite ones. We present a generalized iterative formula to construct nontrivial $(n+1)$-partite ones from the $n$-partite ones.
  arXiv  Detail & Related papers  (2021-09-12T14:02:13Z)
• Finding optimal Bell inequalities using the cone-projection technique [0.0]
  cone-projection technique developed to find optimal Bell inequalities under some constraints. We use the method to generalize the I4422 inequality to three particles and a so-called GYNI inequality to four particles. We discuss the obtained inequalities in some detail and characterize their violation in quantum mechanics.
  arXiv  Detail & Related papers  (2021-03-31T17:50:43Z)
• Quantum Communication Complexity of Distribution Testing [114.31181206328276]
  Two players each receive $t$ samples from one distribution over $[n]$. The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart. We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
  arXiv  Detail & Related papers  (2020-06-26T09:05:58Z)
• Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks [48.32532049640782]
  We study the problem of learning one-hidden-layer ReLU networks with $k$ hidden units on $mathbbRd$ under Gaussian marginals. For the case of positive coefficients, we give the first-time algorithm for this learning problem for $k$ up to $tildeOOmega(sqrtlog d)$.
  arXiv  Detail & Related papers  (2020-06-22T17:53:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.