arXiv:2610.11377
Minimal Scenarios Witnessing Genuine Multipartite Nonlocality Possibilistically
Soumyadip Patra, Peter Bierhorst
Abstract
We study a strong form of genuine multipartite nonlocality (GMNL), where an $n$-partite scenario admits a quantum strategy generating outcomes belonging to a restricted set with certainty, whereas every strategy built from nonclassical resources shared among at most $k<n$ parties fails this criterion with positive probability. This generalizes what is referred to as strong contextuality/nonlocality, or pseudotelepathy, beyond ruling out local models. For the simplest five-party Bell scenario of two binary-outcome measurement settings per party, we use the inflation technique to demonstrate that a game with a perfect quantum strategy witnesses a robust separation from models built from bipartite resources under local operations and shared randomness (LOSR), establishing the behavior is LOSR-GMNL. We provide broader context for this result by investigating its simulability with resources shared among three or four parties under different resource models and alternative definitions of GMNL. A central open question is whether $n$-party quantum resources can achieve such a separation from models built from $(n-1)$-party resources, for $n\ge 3$. We make progress here by constructing a family of robustly LOSR-GMNL games with $ε$-optimal quantum strategies experimentally indistinguishable in the limit from true probability-one-winning strategies for any desired level of precision.
AI Summary
The paper asks whether quantum pseudotelepathy can certify that correlations require resources shared among more than two parties, even against networks of arbitrary bipartite nonclassical resources with local operations and shared randomness (LOSR), rather than only against local or Svetlichny models. For the existing five-cycle game in the $(5,2,2)$ Bell scenario, it proves that a five-qubit strategy wins with certainty while every bipartite-resource LOSR model has winning probability at most $121/126\approx0.9603$. This strengthens a previous $53/54$ bound restricted to wirings. The inflation argument turns perfect parity constraints into equality of independent copies, forcing deterministic outputs and a contradiction. A quantitative version establishes the robustness bound through approximate determinism. The full quantum behavior nevertheless admits a simulation using four-party no-signaling resources. Three-party resources are excluded only for Svetlichny-type $2|3$ decompositions, with bound $5/6$; their sufficiency in general LOSR networks remains open. Fixing one player gives a four-party game with an explicit quantum value $(4+\sqrt2)/6$, matched numerically by NPA upper bounds. A second construction combines chained Bell tests with GHZ outcome alignment. Its tripartite quantum loss scales as $O(N^{-2})$, while bipartite-resource models lose with probability at least $1/(6N)$. Taking $N\ll t\ll N^2$ makes all-win records likely quantumly and unlikely under the restricted model. An extension to $n$ versus $(n-1)$ parties is outlined. Exact pseudotelepathic separation at this resource threshold remains unresolved; the near-perfect construction requires growing setting counts and increasingly precise implementations.
Error found: The displayed chained-Bell game has 4N predicates, but the appendix's normalization and winning-probability formula apply to a different sampling distribution that gives each alignment predicate twice the weight. For uniform sampling of the displayed predicates, the bipartite-resource optimum is 1−1/(8N), contradicting the advertised upper bound 1−1/(6N), and the supplied quantum strategy wins with probability (3+cos(π/(2N)))/4 rather than the stated weighted-game formula.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.