Implausible Consequences of Superstrong Nonlocality

TL;DR

This paper argues that hypothetical superstrong nonlocal correlations would enable trivial communication complexity, suggesting such correlations are unlikely to exist in nature due to computational constraints.

Contribution

It demonstrates that superstrong nonlocal correlations would trivialize distributed computation, providing a new argument against their physical plausibility.

Findings

Superstrong nonlocal correlations imply one-bit communication for all distributed tasks.

Such correlations would eliminate the need for complex communication in distributed computing.

The results provide a computational reason to rule out superstrong nonlocality in nature.

Abstract

This Letter looks at the consequences of so-called 'superstrong nonlocal correlations', which are hypothetical violations of Bell/CHSH inequalities that are stronger than quantum mechanics allows, yet weak enough to prohibit faster-than-light communication. It is shown that the existence of maximally superstrong correlated bits implies that all distributed computations can be performed with a trivial amount of communication, i.e. with one bit. If one believes that Nature does not allow such a computational 'free lunch', then the result in the Letter gives a reason why superstrong correlation are indeed not possible.