Quantum Advantages of Communication Complexity from Bell Nonlocality

Communication games are crucial tools for investigating the limitations of physical theories. The communication complexity (CC) problem is a typical example, for which several distributed parties attempt to jointly calculate a given function with limited classical communications. In this work, we present a method to construct CC problems from Bell tests in a graph-theoretic way. Starting from an experimental compatibility graph and the corresponding Bell test function, a target function that encodes the information of each edge can be constructed; then, using this target function, we can construct a CC function, and by pre-sharing entangled states, its success probability exceeds that of the arbitrary classical strategy. The non-signaling protocol based on the Popescu–Rohrlich box is also discussed, and the success probability in this case reaches one