Quantum advantage for distributed computing without communication

TL;DR

This paper demonstrates that quantum entanglement enables distributed computation without communication, with non-local quantum strategies outperforming classical ones in identity games, highlighting a quantum advantage in information processing.

Contribution

It introduces identity games as a new framework to study quantum entanglement's role in distributed computation without communication, showing quantum strategies outperform classical and non-signaling resources.

Findings

Quantum strategies outperform classical in identity games.

Non-signaling resources double success probability for many functions.

Quantum advantage persists without communication in distributed tasks.

Abstract

Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose a new perspective for studying quantum entanglement: distributed computation of functions without communication between nodes. To formalize this approach, we propose identity games. Surprisingly, despite of no-signaling, we obtain that non-local quantum strategies beat classical ones in terms of winning probability for identity games originating from certain bipartite and multipartite functions. Moreover we show that, for majority of functions, access to general non-signaling resources boosts success probability two times in comparison to classical ones, for number of outputs large enough.