On the computational complexity of detecting possibilistic locality
arXiv:1609.05550 · doi:10.1093/logcom/exx045
Abstract
The proofs of quantum nonlocality due to GHZ and Hardy are quantitatively different from that of Bell insofar as they rely only on a consideration of whether events are possible or impossible, rather than relying on specific experimental probabilities. Here, we consider the computational task of determining whether or not a given table of possibilities constitutes a departure from possibilistic local realism. By considering the case in which one party has access to measurements with two outcomes and the other three, it is possible to see at exactly which point this task becomes computationally difficult.
arXiv comment7 Pages, 4 Figures
References in corpus (8)
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- Relational Hidden Variables and Non-Locality
- Ontological models and the interpretation of contextuality
- Extendability in the Sheaf-theoretic Approach: Construction of Bell Models from Kochen-Specker Models
- Consequences and applications of the completeness of Hardy's nonlocality
- Deriving Tight Bell Inequalities for 2 Parties with Many 2-valued Observables from Facets of Cut Polytopes
- Contextuality under weak assumptions
- How Einstein and/or Schrödinger should have discovered Bell's Theorem in 1936