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.