Robust Bell inequalities from communication complexity

Abstract

The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say that a Bell inequality is normalized if its absolute value does not exceed 1 for any classical (i.e. local) distribution. Upper and (almost) tight lower bounds have been given for the quantum violation of these Bell inequalities in terms of number of outputs of the distribution, number of inputs, and the dimension of the shared quantum states. In this work, we revisit normalized Bell inequalities together with another family: inefficiency-resistant Bell inequalities. To be inefficiency-resistant, the Bell value must not exceed 1 for any local distribution, including those that can abort. This makes the Bell inequality resistant to the detection loophole, while a normalized Bell inequality is resistant to general local noise. Both these families of Bell inequalities are closely related to communication complexity lower bounds. We show how to derive large violations from any gap between classical and quantum communication complexity, provided the lower bound on classical communication is proven using these lower bound techniques. This leads to inefficiency-resistant violations that can be exponential in the size of the inputs. Finally, we study resistance to noise and inefficiency for these Bell inequalities.

Final version for publication in Quantum

References in corpus (29)

• Violations of local realism by two entangled quNits are stronger than for two qubits
• The Communication Cost of Simulating Bell Correlations
• Quantum non-locality in two three-level systems
• The cost of exactly simulating quantum entanglement with classical communication
• An operational framework for nonlocality
• Quantum communication complexity of symmetric predicates
• Large violation of Bell inequalities with low entanglement
• Unbounded violation of tripartite Bell inequalities
• Operator Space theory: a natural framework for Bell inequalities
• Non locality, closing the detection loophole and communication complexity
• Distilling Non-Locality
• Tight multipartite Bell's inequalities involving many measurement settings
• Violations of local realism with quNits up to N=16
• Towards Quantifying Non-Local Information Transfer: Finite-Bit Non-Locality
• Violations of Bell inequalities as lower bounds on the communication cost of non-local correlations
• Quantum communication complexity advantage implies violation of a Bell inequality
• The communication complexity of non-signaling distributions
• Unbounded violations of bipartite Bell Inequalities via Operator Space theory
• A Zoology of Bell inequalities resistant to detector inefficiency
• Quantifying the nonlocality of GHZ quantum correlations by a bounded communication simulation protocol
• Bound non-locality and activation
• Bell scenarios with communication
• Bell inequality with an arbitrary number of settings and its applications
• Bell Inequalities with Communication Assistance
• Near-Optimal and Explicit Bell Inequality Violations
• Classical and quantum partition bound and detector inefficiency
• Reducing the number of inputs in nonlocal games
• Large bipartite Bell violations with dichotomic measurements
• A strong direct product theorem for the tribes function via the smooth-rectangle bound

Cited by in corpus (8)

• Preparation contextuality as an essential feature underlying quantum communication advantage
• Does violation of a Bell inequality always imply quantum advantage in a communication complexity problem?
• Quantum advantages of communication complexity from Bell nonlocality
• Adaptive advantage in entanglement-assisted communications
• Quantum states cannot be transmitted efficiently classically
• The information cost of quantum memoryless protocols
• Semi-device-independent self-testing of unitary operations
• Classical vs. quantum communication in XOR games