Limits of Classical correlations and Quantum advantages under (Anti-)Distinguishability constraints in Multipartite Communication

TL;DR

This paper explores how quantum strategies can outperform classical ones in multipartite communication tasks constrained by (anti-)distinguishability, providing new inequalities and demonstrating quantum advantages without shared entanglement.

Contribution

It introduces a systematic method for deriving facet inequalities for classical correlations and demonstrates quantum advantages in multi-sender scenarios without entanglement.

Findings

Quantum strategies outperform classical ones under (anti-)distinguishability constraints.

Derived complete facet inequalities for specific multi-sender scenarios.

Quantum advantage increases with the number of senders when inputs are binary.

Abstract

We consider communication scenarios with multiple senders and a single receiver. Focusing on communication tasks where the distinguishability or anti-distinguishability of the sender's input is bounded, we show that quantum strategies without any shared entanglement can outperform the classical ones. We introduce a systematic technique for deriving the facet inequalities that delineate the polytope of classical correlations in such scenarios. As a proof of principle, we recover the complete set of facet inequalities for some non-trivial scenarios involving two senders and a receiver with no input. Explicit quantum protocols are studied that violate these inequalities, demonstrating quantum advantage. We further investigate the task of anti-distinguishing the joint input string held by the senders and derive upper bounds on the optimal classical success probability. Leveraging the Pusey Barrett Rudolph theorem, we prove that when each sender has a binary input, the quantum advantage grows with the number of senders. We also provide sufficient conditions for quantum advantage for arbitrary input sizes and illustrate them through several explicit examples.