Bell Inequalities with One Bit of Communication
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 Al...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-02-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/21/2/171 |
| _version_ | 1798024654225408000 |
|---|---|
| author | Emmanuel Zambrini Cruzeiro Nicolas Gisin |
| author_facet | Emmanuel Zambrini Cruzeiro Nicolas Gisin |
| author_sort | Emmanuel Zambrini Cruzeiro |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-11T18:07:22Z |
| format | Article |
| id | doaj.art-326ef642edad41608cbf216b46693984 |
| institution | Directory Open Access Journal |
| issn | 1099-4300 |
| language | English |
| last_indexed | 2024-04-11T18:07:22Z |
| publishDate | 2019-02-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Entropy |
| spelling | doaj.art-326ef642edad41608cbf216b466939842022-12-22T04:10:18ZengMDPI AGEntropy1099-43002019-02-0121217110.3390/e21020171e21020171Bell Inequalities with One Bit of CommunicationEmmanuel Zambrini Cruzeiro0Nicolas Gisin1Department of Applied Physics, University of Geneva, 1211 Geneva, SwitzerlandDepartment of Applied Physics, University of Geneva, 1211 Geneva, SwitzerlandWe 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.https://www.mdpi.com/1099-4300/21/2/171quantum nonlocalitycommunication complexity |
| spellingShingle | Emmanuel Zambrini Cruzeiro Nicolas Gisin Bell Inequalities with One Bit of Communication Entropy quantum nonlocality communication complexity |
| title | Bell Inequalities with One Bit of Communication |
| title_full | Bell Inequalities with One Bit of Communication |
| title_fullStr | Bell Inequalities with One Bit of Communication |
| title_full_unstemmed | Bell Inequalities with One Bit of Communication |
| title_short | Bell Inequalities with One Bit of Communication |
| title_sort | bell inequalities with one bit of communication |
| topic | quantum nonlocality communication complexity |
| url | https://www.mdpi.com/1099-4300/21/2/171 |
| work_keys_str_mv | AT emmanuelzambrinicruzeiro bellinequalitieswithonebitofcommunication AT nicolasgisin bellinequalitieswithonebitofcommunication |