REVIEW 1 cited by
Bell inequalities with one bit of communication
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Bell inequalities with one bit of communication
read the original abstract
We study Bell scenarios with binary outcomes supplemented by one bit of classical communication. We develop 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 solve 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 the facet inequalities found in scenarios without communication, the well known Bell inequalities.
Forward citations
Cited by 1 Pith paper
-
An Operational Framework for Nonclassicality in Quantum Communication Networks
A variational optimization framework computes linear classical bounds on network input/output probabilities whose violation certifies nonclassicality, finding entanglement necessary for nonclassicality in single-sende...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.