Implausible consequences of superstrong nonlocality

Authors:
Wim Dam
Affiliations:
Department of Computer Science, University of California, Santa Barbara, USA 93106-5110 and Department of Physics, University of California, Santa Barbara, USA 93106-5110
Venue:
Natural Computing: an international journal
Year:
2013

Citing 3
Cited 1

Communication complexity

Communication complexity
Quantum Entanglement and the Communication Complexity of the Inner Product Function

QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Complexity classes in communication complexity theory

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Entanglement in interactive proof systems with binary answers

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We look at the consequences of so-called `superstrong nonlocal correlations', which are hypothetical violations of Bell/CHSH inequalities that are stronger than quantum mechanics allows while still preventing the possibility of instantaneous 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 this result gives a reason why superstrong correlation are indeed not possible.