Bound entanglement helps to reduce communication complexity
  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. 
Michael Epping and Caslav Brukner
quant-ph