Bell experiments rule out local common-cause explanations of quantum correlations, yet they do not exclude hidden influences that travel faster than light while still having a finite speed in a preferred frame. Multipartite spacetime arrangements turn this possibility into a constraint: two late parties that are outside each other's hidden-influence cones must remain Bell-local once the earlier events are fixed. Here, we formulate this constraint as a projected-polytope separation problem for cluster-state correlations, using only marginal data containing at most one late party. From linear cluster states, we construct a four-qubit witness with the bound $S_4\le 6$ and quantum value $4+2\sqrt2$, and a five-qubit witness with $S_5\le 10$ and quantum value $6+4\sqrt2$. We certify that the exposed faces are facets of the corresponding projected hidden-influence polytopes. These results identify linear-cluster graph states as certifiable and experimentally friendly resources for finite-speed hidden-influence tests.
Bell experiments rule out local common-cause explanations of quantum correlations, yet they do not exclude hidden influences that travel faster than light while still having a finite speed in a preferred frame. Multipartite spacetime arrangements turn this possibility into a constraint: two late parties that are outside each other's hidden-influence cones must remain Bell-local once the earlier events are fixed. Here, we formulate this constraint as a projected-polytope separation problem for cluster-state correlations, using only marginal data containing at most one late party. From linear cluster states, we construct a four-qubit witness with the bound S4≤6 and quantum value 4+22, and a five-qubit witness with S5≤10 and quantum value 6+42. We certify that the exposed faces are facets of the corresponding projected hidden-influence polytopes. These results identify linear-cluster graph states as certifiable and experimentally friendly resources for finite-speed hidden-influence tests.
Recently, the local friendliness (LF) no-go theorem has attracted considerable interest due to its deep foundational implications. This no-go theorem applies to scenarios which combine Bell experiments with Wigner's friend-type setups, containing spacelike separated superobservers assumed to be capable of performing quantum operations on a local observer, also known as their ``friend.'' The theorem shows that a set of assumptions termed ``local friendliness''---weaker than the set of assumptions required for proving Bell's theorem---constrains the space of probabilistic behaviors in extended Wigner's friend scenarios to the ``local friendliness (LF) polytope,'' and that quantum correlations can, in principle, violate those constraints. In this work, we extend the study of local friendliness to multipartite scenarios---with arbitrary but finite numbers of superobservers, friends, measurements, and outcomes---and fully characterize the corresponding LF polytopes, their relationships with each other, with the Bell polytope, the no-signaling polytope, and the quantum set of correlations. In particular, we identify, via constructive proofs, all the canonical LF scenarios where the LF polytope coincides with the Bell polytope---hence identifying all the scenarios where ``genuine LF inequalities'' may arise. Among other results, we also show that whenever the LF polytope is distinct from the Bell and the no-signaling polytope, it also is neither contained in nor contains the quantum set of correlations. Apart from the foundational motivation of better understanding the constraints from local friendliness, our results may also find use in a priori unrelated contexts of device-independent information processing, where the LF polytopes have also been shown to arise, under the name of ``partially deterministic polytopes.''
Bell inequalities are bounds on the correlations between different parties obeying a local hidden variable theory. Here, "local" refers to spacetime locality: the parties cannot communicate their inputs because they must produce their outputs faster than the speed-of-light delay between them. In other words, the parties must satisfy a certain latency constraint. In this work, we explicitly incorporate spacetime locality into the formulation of Bell inequalities by imposing such a latency constraint. When the latency constraint is sufficiently tight such that no parties can communicate, this becomes a standard Bell scenario. When the latency constraint is relaxed such that a subset of the parties can communicate, we no longer have a Bell scenario, but we can again find a divide between classical and quantum behaviors. Hence, we observe that the classical-quantum gap should actually be a function of time. To study these more general scenarios, we introduce the mathematical framework of latency-constrained games, which models time-evolving input and output processes for spatially separated parties subject to finite communication speeds. This framework allows us to systematically study the weirdness of quantum mechanics in the "low-latency regime" where the speed-of-light delay is non-negligible. Latency-constrained games can describe real-time decision-making in real-world settings that are latency-sensitive, such as high-frequency trading and distributed systems, and can reveal the utility of quantum correlations in these settings.
We study the faces of the set of quantum correlations, i.e., the Bell and noncontextuality inequalities without any quantum violation. First, we investigate the question of whether every proper (facet-defining) Bell inequality for two parties, other than the trivial ones from positivity, normalization, and no-signaling, can be violated by quantum correlations, i.e., whether the classical Bell polytope or the smaller correlation polytope share any facets with their respective quantum sets. To do this, we develop a recently derived bound on the quantum value of linear games based on the norms of game matrices to give a simple sufficient condition to identify linear games with no quantum advantage. Additionally we show how this bound can be extended to the general class of unique games. We then show that the paradigmatic examples of correlation Bell inequalities with no quantum violation, namely the nonlocal computation games, do not constitute facet-defining Bell inequalities, not even for the correlation polytope. We also extend this to an arbitrary prime number of outcomes for a specific class of these games. We then study the faces in the simplest Clauser-Horne-Shimony-Holt Bell scenario of binary dichotomic measurements, and identify edges in the set of quantum correlations in this scenario. Finally, we relate the noncontextual polytope of single-party correlation inequalities with the cut polytope $\text{CUT}(\mathbf{\ensuremath{\nabla}}G)$, where G denotes the compatibility graph of observables in the contextuality scenario and $\mathbf{\ensuremath{\nabla}}G$ denotes the suspension graph of G. We observe that there exist facet-defining noncontextuality inequalities with no quantum violation, and furthermore that this set of inequalities is beyond those implied by the consistent exclusivity principle.
Determining whether observations across spacetime arise from one quantum process is central to causal inference and to consistent observer-relative descriptions. For quantum-state-over-spacetime (QSOST) data, this remains obstructed because causally agnostic interferometry compresses process matrices: every setting can appear physical although its hidden positive completions cannot be glued to a common parent. We formulate this as an inverse positive-lift problem and solve it exactly. Each positive-weight QSOST branch has a unique least positive lift, yielding a data-only common-parent criterion. We prove that settingwise realizability implies common-process realizability for every finite family if and only if the QSOST projection is injective on deterministic processes. Thus any normalized information loss can be exposed as a strict gluing failure. For bipartite qubits we identify a 63-dimensional hidden fiber and construct definite-order separations, including a minimal two-setting, two-outcome example with exact noise threshold η=1/2 and a sparse interferometric witness. Under explicit causal-access conditions, we also derive exact delayed fact-inference limits and identify the minimal environment; restoring full access removes only the pre--post gap. These results identify the boundary between spacetime tomography and global process composition, turning hidden process incompatibility into an experimentally testable phenomenon.
The possibility to explain quantum correlations via (possibly) unknown causal influences propagating gradually and continuously at a finite speed v>c has attracted some attention recently. In particular, it could be shown that this assumption leads to correlations that can be exploited for superluminal communication. This was achieved studying the set of possible correlations that are allowed within such a model and comparing them to correlations produced by local measurements on a four-party entangled quantum state. Here, we report on a quantum state that allows for the same conclusion involving only three parties.
A local deterministic model can reproduce Bell-inequality violations only if the hidden state depends on the measurement settings. Hall found the minimum such dependence for the singlet state [Phys. Rev. Lett. 105, 250404 (2010)] and posed the corresponding problem for the Mermin state [Phys. Rev. A 84, 022102 (2011)]. This paper solves it, for the n-party GHZ-Mermin scenario at every n≥3, with the marginals reproduced as well as the correlators. The minimum measurement-dependence fraction is Fmin(n)=R/[2(R+1)], with R=2⌊(n−1)/2⌋ the Mermin violation ratio: 1/3,2/5,4/9,8/17,…, always below 1/2. The lower bound follows from Mermin's inequality by a general overlap bound; the upper bound is an explicit model, uniform on the hidden-variable classes that violate the fewest constraints, with closed-form counts; a reduction theorem shows that for Mermin scenarios the marginals impose no additional dependence. The Mermin values are also certified by integer-arithmetic enumeration through n=22. The formula was stated as a conjecture in the first version of this paper and was first proved, by a different route, by Wang, Yao and Chen; the proof here was obtained independently and the two agree. Every minimal contradiction of size k among stabilizer constraints has correlator-only minimum 1/(k−1). With the marginals included the minimum is the same on every core of the C5 ring cluster, on the size-4 and size-5 cores of C4 and on every four-core of C6, but larger on the size-6 and size-7 cores of C4 and on 112 of the 1,920 five-cores of C6, with exact certificates on both sides in every case.