Next Article in Journal
Thermodynamics of f(R) Gravity with Disformal Transformation
Next Article in Special Issue
Bounding the Plausibility of Physical Theories in a Device-Independent Setting via Hypothesis Testing
Previous Article in Journal
The Optimized Multi-Scale Permutation Entropy and Its Application in Compound Fault Diagnosis of Rotating Machinery
Previous Article in Special Issue
Efficient Quantum Teleportation of Unknown Qubit Based on DV-CV Interaction Mechanism
Open AccessArticle

Bell Inequalities with One Bit of Communication

Department of Applied Physics, University of Geneva, 1211 Geneva, Switzerland
*
Author to whom correspondence should be addressed.
Entropy 2019, 21(2), 171; https://doi.org/10.3390/e21020171
Received: 13 December 2018 / Revised: 28 January 2019 / Accepted: 6 February 2019 / Published: 13 February 2019
(This article belongs to the Special Issue Quantum Nonlocality)
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. View Full-Text
Keywords: quantum nonlocality; communication complexity quantum nonlocality; communication complexity
Show Figures

Figure 1

MDPI and ACS Style

Zambrini Cruzeiro, E.; Gisin, N. Bell Inequalities with One Bit of Communication. Entropy 2019, 21, 171.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map

1
Back to TopTop