arXiv:2610.32319
Finite Nonsignalling Resources Suffice to Simulate Entangled Qubits
Ziao Tang, Xin Wang, Ge Bai
Abstract
A longstanding question in Bell nonlocality is whether finite-alphabet nonsignalling resources can reproduce the continuum of measurement correlations of partially entangled qubits. Here we resolve this problem by showing that every fixed pure two-qubit state admits an exact simulation of all local projective-measurement statistics using shared randomness and finitely many Popescu-Rohrlich (PR) boxes, without communication or postselection. The boxes operate in parallel, with a worst-case bound independent of the measurement settings: at most $128\cot^4θ$ calls for the Schmidt state $\cosθ|00\rangle+\sinθ|11\rangle$, $0<θ<π/4$. The key is an exact finite-selection method that reduces input-dependent continuous sampling to a choice from a fixed-length shared random list, implemented through a finite PR-box network. The construction extends to arbitrary mixed two-qubit states and local binary-outcome POVMs. This reveals a fundamental separation between the continuity of quantum measurement correlations and the alphabet size of the resources needed to simulate them, shedding light on the resource-theoretic structure of Bell nonlocality.
AI Summary
The paper addresses whether exact correlations from partially entangled qubits, across all local projective-measurement directions, require nonsignalling resources with continuous input alphabets. It constructs a simulation using shared randomness and finitely many binary-input, binary-output Popescu–Rohrlich (PR) boxes, without communication or postselection. For each fixed Schmidt state $\cos\theta|00\rangle+\sin\theta|11\rangle$, with $0<\theta<\pi/4$, the worst-case budget is $K(\theta)=4\lceil\sqrt{2}\pi\cot^2\theta\rceil^2\le128\cot^4\theta$, independent of measurement settings. All PR calls are parallel. Product states require no boxes; the maximally entangled endpoint uses a known one-box protocol. Finite pure-state mixing and local stochastic postprocessing extend the result to every fixed mixed two-qubit state and all local binary-outcome POVMs. The construction starts from a known local–nonlocal decomposition with local weight $\cos(2\theta)$. Its unbiased nonlocal remainder has a distributed-sampling representation involving an Alice-input-dependent continuous density. A finite-selection theorem realizes this density exactly by selecting from an input-independent shared random list: regional candidates supply a piecewise-constant lower envelope, and one global candidate supplies a bounded residual. An index box, implemented with $N-1$ parallel PR boxes for $N$ candidates, coordinates the selected responses. The model permits continuous shared randomness and exact Borel-measurable local processing without bit-complexity bounds. The budget is not claimed optimal and diverges near product states; whether one finite budget covers all pure two-qubit states remains open. General multi-outcome POVMs and an end-to-end finite-precision error analysis are not covered.
Frontier Large Language Models were used during the development of this work. The authors rigorously verified the statement and proof, and prepared the manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 6+9 pages, 1 figure