Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hardy's Non-locality Paradox and Possibilistic Conditions for Non-locality

Published 9 May 2011 in quant-ph | (1105.1819v1)

Abstract: Hardy's non-locality paradox is a proof without inequalities showing that certain non-local correlations violate local realism. It is possibilistic' in the sense that one only distinguishes between possible outcomes (positive probability) and impossible outcomes (zero probability). Here we show that Hardy's paradox is quite universal: in any (2,2,l) or (2,k,2) Bell scenario, the occurence of Hardy's paradox is a necessary and sufficient condition for possibilistic non-locality. In particular, it subsumes all ladder paradoxes. This universality of Hardy's paradox is not true more generally: we find a newproof without inequalities' in the (2,3,3) scenario that can witness non-locality even for correlations that do not display the Hardy paradox. We discuss the ramifications of our results for the computational complexity of recognising possibilistic non-locality.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.