Communication Complexity Reduction from Globally Uncorrelated States

TL;DR

This paper demonstrates that specific multi-qubit states can enhance communication complexity reduction in distributed computing, even without correlations among all particles, expanding the class of functions that benefit from quantum resources.

Contribution

The authors show that certain entangled states can improve distributed computation efficiency without requiring correlations among all particles, broadening quantum advantage scenarios.

Findings

Multi-qubit states can reduce communication complexity.

Efficiency gains occur despite lack of full correlations.

Expanded class of functions benefits from quantum states.

Abstract

Bell inequality violating entangled states are the working horse for many potential quantum information processing applications, including secret sharing, cryptographic key distribution and communication complexity reduction in distributed computing. Here we explicitly demonstrate the power of certain multi-qubit states to improve the efficiency of partners in joint computation of some multi-qubit function, despite the fact that there could be no correlations between all distributed particles. It is important to stress that the class of functions that can be computed more efficiently is widened, as compared with the standard Bell inequalities.