Zambrini Cruzeiro Emmanuel, Gisin Nicolas
Department of Applied Physics, University of Geneva, 1211 Geneva, Switzerland.
Entropy (Basel). 2019 Feb 13;21(2):171. doi: 10.3390/e21020171.
We study Bell scenarios with binary outcomes supplemented by one bit of classical communication. We developed 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 solved 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 facet inequalities found in scenarios without communication, that is, the well-known Bell inequalities.
我们研究具有二元结果并辅以一位经典通信的贝尔场景。我们开发了一种方法，即使在无法直接进行面枚举或至少很困难的情况下，也能找到此类场景的面不等式。使用这种方法，我们部分解决了爱丽丝和鲍勃在三个输入之间进行选择的场景，总共找到了668个不等价的面不等式（相对于输入和输出的重新标记）。我们还表明，其中一些不等式是由无通信场景中发现的面不等式构建而成的，即著名的贝尔不等式。
