Article (Published version) (360 Kb) - 
Free accessOther version: http://www.mdpi.com/1099-4300/21/2/171
Highlights
Scientific Article
unige:131919 
 |
Bell Inequalities with One Bit of Communication |
|
| Authors | ||
| Published in | Entropy. 2019, vol. 21, no. 2, p. 171 | |
| Abstract | 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. | |
| Identifiers | DOI: 10.3390/e21020171 | |
| Full text |
Article (Published version) (360 Kb) - Free access Other version: http://www.mdpi.com/1099-4300/21/2/171 |
|
| Structures | ||
| Citation (ISO format) | ZAMBRINI CRUZEIRO, Emmanuel, GISIN, Nicolas. Bell Inequalities with One Bit of Communication. In: Entropy, 2019, vol. 21, n° 2, p. 171. doi: 10.3390/e21020171 https://archive-ouverte.unige.ch/unige:131919 |
59 hits 
23 downloads 
Contact an author
Update