Scientific article
OA Policy
English

Bell Inequalities with One Bit of Communication

Published inEntropy, vol. 21, no. 2, 171
Publication date2019
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.

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
Main files (1)
Article (Published version)
accessLevelPublic
Identifiers
Additional URL for this publicationhttp://www.mdpi.com/1099-4300/21/2/171
Journal ISSN1099-4300
304views
324downloads

Technical informations

Creation06/03/2020 09:54:00
First validation06/03/2020 09:54:00
Update time15/03/2023 21:13:15
Status update15/03/2023 21:13:14
Last indexation31/10/2024 17:57:23
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack