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

Abstract

We consider communication scenarios with multiple senders and a single receiver. Focusing on communication tasks where the distinguishability or antidistinguishability 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 nontrivial 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 antidistinguishing 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.