Bound entanglement helps to reduce communication complexity

Abstract

We present a simple communication complexity problem where three parties benefit from sharing bound entanglement. This demonstrates that entanglement distillability of the shared state is not necessary in order to surpass classical communication complexity.

6 pages, no figures

References in corpus (3)

• All entangled states display some hidden nonlocality
• On the relation between Bell inequalities and nonlocal games
• Local Indistinguishability and Possibility of Hiding cbits in Activable Bound Entangled States