2000 character limit reached
Hardy's Paradox for High-Dimensional Systems: Beyond Hardy's Limit
Published 21 Aug 2013 in quant-ph | (1308.4468v2)
Abstract: Hardy's proof is considered the simplest proof of nonlocality. Here we introduce an equally simple proof that (i) has Hardy's as a particular case, (ii) shows that the probability of nonlocal events grows with the dimension of the local systems, and (iii) is always equivalent to the violation of a tight Bell inequality.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.