The Hardy's theorem [Phys. Rev. Lett. 71 (1993) 1665] is extended to n spin-s particles. As expected, the entangled states for these particles also admit a proof of nonlocality without using inequalities.
We provide a streamlined proof of Hardy's theorem, that almost every entangled state for a pair of quantum particles admits a ``proof of nonlocality'' without inequalities. Moreover, our analysis covers a larger class of observables. Thus we also strengthen Hardy's assertion that the argument fails for maximally entangled states, such as the singlet state. At the same time, we formulate the argument in such a manner that the relations which must be satisfied for local hidden variables are entirely deterministic, making no reference whatsoever to probability, let alone probablistic inequalities.
The ladder proof of nonlocality without inequalities for two spin-21 particles proposed by Hardy [in New Developments on Fundamental Problems in Quantum Physics, edited by M. Ferrero and A. van der Merwe (Kluwer, Dordrecht, 1997)] and Hardy and co-workers [Phys. Rev. Lett. 79, 2755 (1997)] works only for nonmaximally entangled states and goes through for 50% of pairs at the most. A similar ladder proof for two spin-1 particles in a maximally entangled state is presented. In its simplest form, the proof goes through for 17% of pairs. An extended version works for 100% of pairs. The proof can be extended to any maximally entangled state of two spin-s particles (with s>1).
In this paper we provide a simple proof of the fact that for a system of two spin-1/2 particles, and for a choice of observables, there is a unique state which shows Hardy-type nonlocality. Moreover, an explicit expression for the probability that an ensemble of particle pairs prepared in such a state exhibits a Hardy-type nonlocality contradiction is given in terms of two independent parameters related to the observables involved. Incidentally, a wrong statement expressed in Mermin's proof of the converse [N.D. Mermin, Am. J. Phys. 62, 880 (1994)] is pointed out.