Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.32319

Finite Nonsignalling Resources Suffice to Simulate Entangled Qubits

Ziao Tang, Xin Wang, Ge Bai

quant-phSubmitted Oct 23, 2026• Announced Oct 26, 2026• 0 citations
arXivHTMLPDF

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.

Little sign of AI-generated textAI use disclosed
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

Related papers

Quantum communication and Bell nonlocality require infinite classical communication to simulate

Carlos de Gois, Thyago S. R. Santos, Carlos Vieira

A quantum system of any fixed dimension can be prepared in a continuum of states, yet it cannot be used to transmit an unlimited amount of classical information. Similarly, the correlations observed between measurement outcomes on separate parts of a shared quantum system can be stronger than classical correlations, but they cannot transmit information. These fundamental limitations suggest that the statistics observed from quantum communication and quantum correlations may admit a simulation using a finite amount of classical communication. This expectation is confirmed in the smallest nontrivial quantum dimension, with two classical bits being necessary and sufficient to exactly simulate qubit communication and all correlations between qubits. Despite significant efforts during the previous decades, this remained the only solved case. Here we resolve both problems for every quantum dimension. The solution reveals an unexpected qualitative transition starting at dimension four: no finite amount of classical communication can exactly simulate ququart communication nor all quantum correlations of two entangled ququarts, even with unlimited shared randomness. One might have expected this transition, if it existed, to appear already for qutrits. Instead, we construct an explicit protocol that exactly simulates qutrit communication using $357$ classical bits, and consequently, all correlations of two entangled qutrits.

quant-pharXiv:2609.04182•Sep 4, 2026•5 citations

Simulating quantum correlations as a distributed sampling problem

Julien Degorre, Sophie Laplante, Jérémie Roland

It is known that quantum correlations exhibited by a maximally entangled qubit pair can be simulated with the help of shared randomness, supplemented with additional resources, such as communication, postselection or nonlocal boxes. For instance, in the case of projective measurements, it is possible to solve this problem with protocols using one bit of communication or making one use of a nonlocal box. We show that this problem reduces to a distributed sampling problem. We give a new method to obtain samples from a biased distribution, starting with shared random variables following a uniform distribution, and use it to build distributed sampling protocols. This approach allows us to derive, in a simpler and unified way, many existing protocols for projective measurements, and extend them to positive operator value measurements. Moreover, this approach naturally leads to a local hidden variable model for Werner states.

arXiv:quant-ph/0507120•Physical Review A•Dec 9, 2005•91 citations

Perfect non-local quantum computation is impossible

Marten Folkertsma, Dmitry Grinko, Gina Muuss +1 more

Non-local quantum computation (NLQC) asks two parties to apply a joint operation to their quantum inputs using an entangled resource state and one round of simultaneous quantum communication. NLQC has applications across quantum information, including attacks on quantum position verification, communication complexity, and quantum gravity. Every bipartite unitary has an approximate NLQC protocol with finite entanglement, and exact protocols are known for several structured families. However, it has remained open whether every fixed unitary admits an exact protocol with finite-dimensional resources. We show that, even for two qubits, Haar-almost every unitary does not admit such a protocol, even when the resource state and local operations are tailored to the target. The proof first shows that smooth deformations of an exact protocol can only change its target by local unitaries. For a fixed architecture, semialgebraic geometry limits the exact protocols to finitely many connected families, so each architecture reaches only finitely many local-unitary orbits. Taking the union over all architectures, the exactly implementable unitaries form countably many local-unitary orbits. We also show that some natural targets do not admit a protocol: the controlled phase $\mathrm{diag}(1,1,1,e^{iθ})$ has no exact protocol with finite-dimensional resources whenever $e^{iθ}$ is transcendental, for instance for $θ= 1$. Our results also apply to localizable quantum measurements, whose outcome is obtained from local measurements on inputs and a shared entangled resource state without communication. A rank-one projective measurement in a Haar-random basis is almost surely not localizable with a finite-dimensional resource state and finitely many local outcomes.

quant-pharXiv:2609.40228•Oct 1, 2026•0 citations

Photonic Simulation of Beyond-Quantum Nonlocal Correlations (e.g. Popescu-Rohrlich Box) with Non-Signaling Quantum Resources

Shukla, Kunal, Anirudh Verma, Kanad Sengupta +3 more

Bell nonlocality exemplifies the most profound departure of quantum theory from classical realism. Yet, the extent of nonlocality in quantum theory is intrinsically bounded, falling short of the correlations permitted by the relativistic causality (the no-signaling) principle. A paradigmatic example is the Popescu-Rohrlich correlation: two distant parties sharing arbitrary entanglement cannot achieve this correlation, though it can be simulated with classical communication between them. Here we show how such post-quantum correlations can instead be simulated using intrinsically non-signaling physical resources, and implement the proposed scheme using a quantum circuit on a four-qubit photonic platform. Unlike the conventional approaches, our method exploits dynamical correlations between distinct physical systems, with intrinsic randomness suppressing any signaling capacity. This enables the realization of post-quantum correlations both with and without entanglement. We also analyze how the simulation scheme extends to beyond quantum nonlocal correlations in multipartite systems. Our experimental demonstration using a photonic system establishes a versatile framework for exploring post-quantum correlations in both foundational settings and as a resource for computation and security applications.

arXiv:2509.26271•Sep 30, 2025•0 citations

Universal Bell Correlations Do Not Exist

Cole Graham, William M. Hoza

We prove that there is no finite-alphabet nonlocal box that generates exactly those correlations that can be generated using a maximally entangled pair of qubits. More generally, we prove that if some finite-alphabet nonlocal box is strong enough to simulate arbitrary local projective measurements of a maximally entangled pair of qubits, then that nonlocal box cannot itself be simulated using any finite amount of entanglement. We also give a quantitative version of this theorem for approximate simulations, along with a corresponding positive result.

arXiv:1612.05680•Physical Review Letters•Aug 1, 2017•0 citations

Bounding Two-Way Average Communication Cost of Simulating Quantum Correlations

Kai-Siang Chen, Gelo Noel M. Tabia, Bo-An Tsai +2 more

Bell nonlocal correlations cannot be reproduced by local hidden-variable models without communication, making classical communication cost a natural quantitative measure of nonlocality. Although finite communication always suffices to simulate any correlation in a fixed finite Bell scenario, determining the minimum amount needed to (exactly) simulate any given nonlocal correlation remains challenging, especially in the average-cost setting. Here, we derive lower bounds on input-average communication cost from nonlocal games, allowing variable-length, fully interactive two-way protocols. When applied to parallel games, these bounds yield explicit finite quantum correlations for which the exact simulation cost exceeds any prescribed finite input-average communication budget. For $n$ parallel Magic-Square-winning correlations, we prove a lower bound of $n\log_2(3/2)$ bits and give a one-way communication protocol that attains this rate asymptotically. For the quantum correlation maximally winning the $n$-copy of the Clauser--Horne--Shimony--Holt nonlocal game, we obtain an input-average lower bound of approximately $0.04627n$ bits for exact simulation. Finally, we formulate a hierarchy of lower bounds and complementary upper bounds using deterministic correlations up to chosen communication costs. Both recover the exact input-average cost at their final levels, and if the bounds agree at lower levels, their common value yields the exact input-average cost without needing to consider all communication strategies.

quant-pharXiv:2610.04648•Oct 6, 2026•0 citations
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 128cot⁡4θ128\cot^4θ128cot4θ calls for the Schmidt state cos⁡θ∣00⟩+sin⁡θ∣11⟩\cosθ|00\rangle+\sinθ|11\ranglecosθ∣00⟩+sinθ∣11⟩, 0<θ<π/40<θ<π/40<θ<π/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.
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⁡θ∣00⟩+sin⁡θ∣11⟩\cos\theta|00\rangle+\sin\theta|11\ranglecosθ∣00⟩+sinθ∣11⟩, with 0<θ<π/40<\theta<\pi/40<θ<π/4, the worst-case budget is K(θ)=4⌈2πcot⁡2θ⌉2≤128cot⁡4θK(\theta)=4\lceil\sqrt{2}\pi\cot^2\theta\rceil^2\le128\cot^4\thetaK(θ)=4⌈2​πcot2θ⌉2≤128cot4θ, 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θ)\cos(2\theta)cos(2θ). 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−1N-1N−1 parallel PR boxes for NNN 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.
A quantum system of any fixed dimension can be prepared in a continuum of states, yet it cannot be used to transmit an unlimited amount of classical information. Similarly, the correlations observed between measurement outcomes on separate parts of a shared quantum system can be stronger than classical correlations, but they cannot transmit information. These fundamental limitations suggest that the statistics observed from quantum communication and quantum correlations may admit a simulation using a finite amount of classical communication. This expectation is confirmed in the smallest nontrivial quantum dimension, with two classical bits being necessary and sufficient to exactly simulate qubit communication and all correlations between qubits. Despite significant efforts during the previous decades, this remained the only solved case. Here we resolve both problems for every quantum dimension. The solution reveals an unexpected qualitative transition starting at dimension four: no finite amount of classical communication can exactly simulate ququart communication nor all quantum correlations of two entangled ququarts, even with unlimited shared randomness. One might have expected this transition, if it existed, to appear already for qutrits. Instead, we construct an explicit protocol that exactly simulates qutrit communication using 357357357 classical bits, and consequently, all correlations of two entangled qutrits.
It is known that quantum correlations exhibited by a maximally entangled qubit pair can be simulated with the help of shared randomness, supplemented with additional resources, such as communication, postselection or nonlocal boxes. For instance, in the case of projective measurements, it is possible to solve this problem with protocols using one bit of communication or making one use of a nonlocal box. We show that this problem reduces to a distributed sampling problem. We give a new method to obtain samples from a biased distribution, starting with shared random variables following a uniform distribution, and use it to build distributed sampling protocols. This approach allows us to derive, in a simpler and unified way, many existing protocols for projective measurements, and extend them to positive operator value measurements. Moreover, this approach naturally leads to a local hidden variable model for Werner states.
Non-local quantum computation (NLQC) asks two parties to apply a joint operation to their quantum inputs using an entangled resource state and one round of simultaneous quantum communication. NLQC has applications across quantum information, including attacks on quantum position verification, communication complexity, and quantum gravity. Every bipartite unitary has an approximate NLQC protocol with finite entanglement, and exact protocols are known for several structured families. However, it has remained open whether every fixed unitary admits an exact protocol with finite-dimensional resources. We show that, even for two qubits, Haar-almost every unitary does not admit such a protocol, even when the resource state and local operations are tailored to the target. The proof first shows that smooth deformations of an exact protocol can only change its target by local unitaries. For a fixed architecture, semialgebraic geometry limits the exact protocols to finitely many connected families, so each architecture reaches only finitely many local-unitary orbits. Taking the union over all architectures, the exactly implementable unitaries form countably many local-unitary orbits. We also show that some natural targets do not admit a protocol: the controlled phase diag(1,1,1,eiθ)\mathrm{diag}(1,1,1,e^{iθ})diag(1,1,1,eiθ) has no exact protocol with finite-dimensional resources whenever eiθe^{iθ}eiθ is transcendental, for instance for θ=1θ= 1θ=1. Our results also apply to localizable quantum measurements, whose outcome is obtained from local measurements on inputs and a shared entangled resource state without communication. A rank-one projective measurement in a Haar-random basis is almost surely not localizable with a finite-dimensional resource state and finitely many local outcomes.
Bell nonlocality exemplifies the most profound departure of quantum theory from classical realism. Yet, the extent of nonlocality in quantum theory is intrinsically bounded, falling short of the correlations permitted by the relativistic causality (the no-signaling) principle. A paradigmatic example is the Popescu-Rohrlich correlation: two distant parties sharing arbitrary entanglement cannot achieve this correlation, though it can be simulated with classical communication between them. Here we show how such post-quantum correlations can instead be simulated using intrinsically non-signaling physical resources, and implement the proposed scheme using a quantum circuit on a four-qubit photonic platform. Unlike the conventional approaches, our method exploits dynamical correlations between distinct physical systems, with intrinsic randomness suppressing any signaling capacity. This enables the realization of post-quantum correlations both with and without entanglement. We also analyze how the simulation scheme extends to beyond quantum nonlocal correlations in multipartite systems. Our experimental demonstration using a photonic system establishes a versatile framework for exploring post-quantum correlations in both foundational settings and as a resource for computation and security applications.
We prove that there is no finite-alphabet nonlocal box that generates exactly those correlations that can be generated using a maximally entangled pair of qubits. More generally, we prove that if some finite-alphabet nonlocal box is strong enough to simulate arbitrary local projective measurements of a maximally entangled pair of qubits, then that nonlocal box cannot itself be simulated using any finite amount of entanglement. We also give a quantitative version of this theorem for approximate simulations, along with a corresponding positive result.
Bell nonlocal correlations cannot be reproduced by local hidden-variable models without communication, making classical communication cost a natural quantitative measure of nonlocality. Although finite communication always suffices to simulate any correlation in a fixed finite Bell scenario, determining the minimum amount needed to (exactly) simulate any given nonlocal correlation remains challenging, especially in the average-cost setting. Here, we derive lower bounds on input-average communication cost from nonlocal games, allowing variable-length, fully interactive two-way protocols. When applied to parallel games, these bounds yield explicit finite quantum correlations for which the exact simulation cost exceeds any prescribed finite input-average communication budget. For nnn parallel Magic-Square-winning correlations, we prove a lower bound of nlog⁡2(3/2)n\log_2(3/2)nlog2​(3/2) bits and give a one-way communication protocol that attains this rate asymptotically. For the quantum correlation maximally winning the nnn-copy of the Clauser--Horne--Shimony--Holt nonlocal game, we obtain an input-average lower bound of approximately 0.04627n0.04627n0.04627n bits for exact simulation. Finally, we formulate a hierarchy of lower bounds and complementary upper bounds using deterministic correlations up to chosen communication costs. Both recover the exact input-average cost at their final levels, and if the bounds agree at lower levels, their common value yields the exact input-average cost without needing to consider all communication strategies.