Reducing the communication complexity with quantum entanglement
  We propose a probabilistic two-party communication complexity scenario with a prior nonmaximally entangled state, which results in less communication than that is required with only classical random correlations. A simple all-optical implementation of this protocol is presented and demonstrates our conclusion. 
Peng Xue, Yun-Feng Huang, Yong-Sheng Zhang, Chuan-Feng Li, and   Guang-Can Guo (University of Science and Technology of China)