“No Quantum Advantage for Nonlocal Computation”, Noah Linden, Sandu Popescu, Anthony J. Short, Andreas Winter2006-10-12 (computability)⁠:

[Where does Tsirelson’s bound come from?] We investigate the problem of “nonlocal” computation, in which separated parties must compute a function with non-locally encoded inputs and output, such that each party individually learns nothing, yet together they compute the correct function output.

We show that the best that can be done classically is a trivial linear approximation.

Surprisingly, we also show that quantum entanglement provides no advantage over the classical case. On the other hand, generalized (ie. super-quantum) nonlocal correlations allow perfect nonlocal computation.

This gives new insights into the nature of quantum nonlocality and its relationship to generalized nonlocal correlations.