Abstract. The no-signaling constraint on bi-partite correlations is reviewed. It is shown that in order to obtain non-trivial Bell-type inequalities that discern no-signaling correlations from more general ones, one must go beyond considering expectation values of products of observables only. A new set of nontrivial no-signaling inequalities is derived which have a remarkably close resemblance to the CHSH inequality, yet are fundamentally different. A set of inequalities by Roy and Singh [29] and Avis et al. [1], which is claimed to be useful for discerning no-signaling correlations, is shown to be trivially satisfied by any correlation whatsoever. Finally, using the set of newly derived no-signaling inequalities a result with potential cryptographic consequences is proven: if different parties use identical devices, then, once they have perfect correlations at spacelike separation between dichotomic observables, they know that because of no-signaling the local marginals cannot but be completely random.Keywords: no-signaling, perfect correlations, local randomness, cryptography PACS: 03.65.Ta, 03.65.Ud
I: INTRODUCTIONEver since Bell's seminal set of papers [4,5] the study of non-local and quantum correlations has been of paramount importance for the understanding of the foundations of quantum physics. Recently, however, it has become clear that a different, more general kind of correlations need to be understood as well. These are the correlations that obey a no-signaling constraint, which is roughly the requirement by special relativity that signals cannot be communicated in a spacelike fashion. During the last ten years or so these no-signaling correlations have been extensively studied.In this paper we first review in section II the idea of bi-partite correlations as joint probability distributions and what is known about the structure of the convex set of such probability distributions. In more detail we will next consider the no-signaling constraint and its associated polytope of no-signaling correlations. We restrict ourselves to two parties only, but we note that generalisations are not straightforward, see Seevinck [31]. In section III it is shown that in order to obtain non-trivial Bell-type inequalities that discern no-signaling correlations from more general ones, one must go beyond considering expectation values of products of observables only (as is for example the case in the CHSH inequality for local correlations). A new set of nontrivial no-signaling inequalities is derived in section IV which have a remarkably close resemblance to the CHSH inequality, yet are fundamentally different. A set of inequalities by Roy and Singh [29] and Avis et al. [1], which is claimed by them to be useful for discerning no-signaling correlations, is shown to be trivially satisfied by any correlation whatsoever, including signaling ones. Finally, using the newly presented set of no-signaling inequalities a result with potential cryptographic consequences is proven: if different parties use identical devices then, on...