Searcharxiv⌕ Search

arXiv · 2610.23367

Bell scenarios encode classical non-causality

Abstract

Bell and contextuality scenarios are unified within the Acín-Fritz-Leverrier-Sainz hypergraph formalism, in which measurements are hyperedges. Multipartite measurements are obtained from product rules that combine independent contextuality scenarios into a single hypergraph. Several such rules exist: they are structurally distinct, yet yield the same classical, quantum, and boxworld correlations. Here, we show that this difference is not incidental, unveiling an unexpected connection. The measurements of composite Bell scenarios are exactly the process functions, the deterministic classical communication protocols that may be non-causal, i.e., lack a definite causal order without generating paradoxes. Validity of a hyperedge and logical consistency of a process function are thus one and the same condition. This allows us to characterize process functions by normalization and no-signaling alone, providing transformations that generate non-causal process functions from no-communication ones. The product rules, in turn, order process functions by causal structure, from no-communication to non-causality, which yields a graphical criterion for the latter: a process function is non-causal precisely when its hyperedge is generated by the disjunctive but not the maximal product. We thereby obtain the first joint hypergraph representation of (non-causal) process functions and (nonlocal-without-entanglement) measurements, recasting classical non-causality as a non-standard way of composing black boxes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas Leitherer, Kyrylo Simonov, Ravi Kunjwal, Antonio Acín, Kuntal Sengupta, Hippolyte Dourdent. 2026-10-16. Bell scenarios encode classical non-causality. https://arxiv.org/abs/2610.23367

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

MIP*=RE

We show that the class MIP* of languages that can be decided by a classical verifier interacting with multiple all-powerful quantum provers sharing entanglement is equal to the class RE of recursively enumerable languages. Our proof builds upon the quantum low-degree test of (Natarajan and Vidick, FOCS 2018) and the classical low-individual degree test of (Ji, et al., 2020) by integrating recent developments from (Natarajan and Wright, FOCS 2019) and combining them with the recursive compression framework of (Fitzsimons et al., STOC 2019). An immediate byproduct of our result is that there is an efficient reduction from the Halting Problem to the problem of deciding whether a two-player nonlocal game has entangled value $1$ or at most $1/2$. Using a known connection, undecidability of the entangled value implies a negative answer to Tsirelson's problem: we show, by providing an explicit example, that the closure $C_{qa}$ of the set of quantum tensor product correlations is strictly included in the set $C_{qc}$ of quantum commuting correlations. Following work of (Fritz, Rev. Math. Phys. 2012) and (Junge et al., J. Math. Phys. 2011) our results provide a refutation of Connes' embedding conjecture from the theory of von Neumann algebras.

quant-ph↗

Molecular Ground State Simulation by Subspace Restriction and Hund's Rule

The Subspace Restriction Scheme (SRS) is presented to address the qubit and resource constraints of molecular simulation on near-term quantum hardware. SRS restricts a molecular Hamiltonian to a selected determinant subspace before qubit encoding, so a $D$-dimensional subspace requires only $q=\lceil\log_2D\rceil$ qubits. We apply SRS to the established seniority-resolved Multi-Hund Subspaces $\mathrm{MHS}(Ω)$ and develop compact encodings for these sectors. At fixed seniority and filling fraction, MHS asymptotically uses about half as many qubits as a compact particle-conserving encoding. For the $\mathrm{H}_{22}$ chain, the register shrinks from $44$ to $20$ qubits. Compression can nevertheless increase Pauli-operator density and does not always reduce measurement cost. In noiseless VQE benchmarks, shallow circuits reach within $1.6$~mHa of the exact subspace minima using only $4$--$30$ CNOT gates. However, the corresponding subspace minima for LiH, HF, OH, and CH remain $4.39$--$9.73$~mHa above FCI. Full-space UCCSD reaches chemical accuracy but requires hundreds to thousands of CNOT gates. SRS therefore provides a controlled resource--accuracy trade-off when register width is the binding constraint and the target state is well represented within a selected seniority sector.

quant-ph↗

Predicting Dynamics from Flows of the Eigenstate Thermalization Hypothesis

Analytical treatments of far-from-equilibrium quantum dynamics are few, even in well-thermalizing systems. The celebrated eigenstate thermalization hypothesis (ETH) provides a post hoc ansatz for the matrix elements of observables in the eigenbasis of a thermalizing Hamiltonian, given various response functions of those observables as input. However, the ETH cannot predict these response functions. We introduce a procedure, dubbed the statistical Jacobi approximation (SJA), to update the ETH ansatz after a perturbation to the Hamiltonian and predict perturbed response functions. The Jacobi algorithm diagonalizes the perturbation through a sequence of two-level rotations. The SJA implements these rotations statistically assuming the ETH throughout the diagonalization procedure, and generates integrodifferential flow equations for various form factors in the ETH ansatz. We approximately solve these flow equations using statistical information about Jacobi rotations as input, and predict both quench dynamics and autocorrelators in the thermal state of the perturbed Hamiltonian. The predicted dynamics agree with exact numerics in both random matrix models and spin chains, outperforming second-order time-dependent perturbation theory.

quant-ph↗