Does violation of a Bell inequality always imply quantum advantage in a communication complexity problem?

Abstract

Quantum correlations which violate a Bell inequality are presumed to power better-than-classical protocols for solving communication complexity problems (CCPs). How general is this statement? We show that violations of correlation-type Bell inequalities allow advantages in CCPs, when communication protocols are tailored to emulate the Bell no-signaling constraint (by not communicating measurement settings). Abandonment of this restriction on classical models allows us to disprove the main result of, inter alia, [Brukner et. al., Phys Rev. Lett. 89, 197901 (2002)]; we show that quantum correlations obtained from these communication strategies assisted by a small quantum violation of the CGLMP Bell inequalities do not imply advantages in any CCP in the input/output scenario considered in the reference. More generally, we show that there exists quantum correlations, with nontrivial local marginal probabilities, which violate the $I_{3322}$ Bell inequality, but do not enable a quantum advantange in any CCP, regardless of the communication strategy employed in the quantum protocol, for a scenario with a fixed number of inputs and outputs

arXiv commentAccepted for publication in Quantum

References in corpus (24)

• Quantum Communication
• Bell inequalities for arbitrarily high dimensional systems
• Remote State Preparation
• Non-locality and Communication Complexity
• Bounding the set of quantum correlations
• Substituting Quantum Entanglement for Communication
• The uncertainty principle determines the non-locality of quantum mechanics
• A Relevant Two Qubit Bell Inequality Inequivalent to the CHSH Inequality
• Violation of Bell's inequality: criterion for quantum communication complexity advantage
• The cost of exactly simulating quantum entanglement with classical communication
• Quantum communication complexity protocol with two entangled qutrits
• Quantum Entanglement and Communication Complexity
• Entanglement assisted random access codes
• Quantum communication complexity advantage implies violation of a Bell inequality
• Experimental quantum communication complexity
• High-dimensional quantum communication complexity beyond strategies based on Bell's theorem
• Spatial versus Sequential Correlations for Random Access Coding
• Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement
• Semi-device-independent characterisation of multipartite entangled states and measurements
• Complementarity between entanglement-assisted and quantum distributed random access code
• Higher dimensional communication complexity problems: classical protocols vs quantum ones based on Bell's Theorem or prepare-transmit-measure schemes
• The Magical Number Seven: An Unexpected Dimensional Threshold in Quantum Communication Complexity
• Biased nonlocal quantum games
• Robust Bell inequalities from communication complexity

Cited by in corpus (13)

• Correlations in entanglement-assisted prepare-and-measure scenarios
• Entanglement in prepare-and-measure scenarios: many questions, a few answers
• Oblivious communication game, self-testing of projective and non-projective measurements and certification of randomness
• Quantum communication complexity beyond Bell nonlocality
• Quantum advantages of communication complexity from Bell nonlocality
• Adaptive advantage in entanglement-assisted communications
• Generalizing optimal Bell inequalities
• Interplays between classical and quantum entanglement-assisted communication scenarios
• Self-testing of multiple unsharpness parameters through sequential violations of non-contextual inequality
• Scalable & Noise-Robust Communication Advantage of Multipartite Quantum Entanglement
• Weak entanglement improves quantum communication using only product measurements
• Gottesman-Knill Limit on One-way Communication Complexity: Tracing the Quantum Advantage down to Magic Resources
• Quantum inputs in the prepare-and-measure scenario and stochastic teleportation