Bell inequalities with one bit of communication

Abstract

We study Bell scenarios with binary outcomes supplemented by one bit of classical communication. We develop a method to find facet inequalities for such scenarios even when direct facet enumeration is not possible, or at least difficult. Using this method, we partially solve the scenario where Alice and Bob choose between three inputs, finding a total of 668 inequivalent facet inequalities (with respect to relabelings of inputs and outputs). We also show that some of these inequalities are constructed from the facet inequalities found in scenarios without communication, the well known Bell inequalities.

References in corpus (18)

• Bell nonlocality
• The Communication Cost of Simulating Bell Correlations
• A Relevant Two Qubit Bell Inequality Inequivalent to the CHSH Inequality
• The cost of exactly simulating quantum entanglement with classical communication
• Popescu-Rohrlich correlations as a unit of nonlocality
• Quantum entanglement can be simulated without communication
• A local hidden variable model of quantum correlation exploiting the detection loophole
• Interconversion of Nonlocal Correlations
• Quantum Bounds on Bell inequalities
• Partial list of bipartite Bell inequalities with four binary settings
• 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 violation of an instrumental test
• Bell Inequalities with Auxiliary Communication
• Quantum violations in the Instrumental scenario and their relations to the Bell scenario
• Bell scenarios with communication
• Bell Inequalities with Communication Assistance
• Complete list of Bell inequalities with four binary settings

Cited by in corpus (7)

• Quantum Blackjack or Can MIT Bring Down the House Again?
• Neural Network Approach to the Simulation of Entangled States with One Bit of Communication
• The minimal communication cost for simulating entangled qubits
• Tight Bell inequalities from polytope slices
• Loophole-free Bell tests with randomly chosen subsets of measurement settings
• Beating one bit of communication with and without quantum pseudo-telepathy
• Beating one bit of communication with quantum correlations in smaller dimensions