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.

20 pages

References in corpus (29)

• Quantum fingerprinting
• On the reality of the quantum state
• Contextuality for preparations, transformations, and unsharp measurements
• Quantum random number generation
• Semi-device-independent security of one-way quantum key distribution
• Preparation contextuality powers parity-oblivious multiplexing
• Source-independent quantum random number generation
• Semi-device independent random number expansion without entanglement
• Conditions for compatibility of quantum state assignments
• State independent contextuality advances one-way communication
• High fidelity state preparation, quantum control, and readout of an isotopically enriched silicon spin qubit
• Fast and high-fidelity state preparation and measurement in triple-quantum-dot spin qubits
• Classical information storage in an $n$-level quantum system
• Connections Between Mutually Unbiased Bases and Quantum Random Access Codes
• Quantum contextuality provides communication complexity advantage
• Preparation contextuality as an essential feature underlying quantum communication advantage
• Testing dimension and non-classicality in communication networks
• Characterising and bounding the set of quantum behaviours in contextuality scenarios
• Informationally restricted quantum correlations
• Informationally restricted correlations: a general framework for classical and quantum systems
• Certifying entangled measurements in known Hilbert spaces
• Complementarity between entanglement-assisted and quantum distributed random access code
• Quantum prescriptions are more ontologically distinct than they are operationally distinguishable
• Mutually Unbiased Balanced Functions & Generalized Random Access Codes
• Tight bounds for antidistinguishability and circulant sets of pure quantum states
• Random access codes and non-local resources
• Unbounded quantum advantage in communication complexity measured by distinguishability
• Multiparty quantum random access codes
• Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities