Bound on tri-partite Hardy's nonlocality respecting all bi-partite principles
نویسندگان
چکیده
Recently, Gallego et al. [Phys. Rev. Lett. 107, 210403 (2011)] proved that any future information principle aiming at distinguishing between quantum and postquantum correlation must be intrinsically multipartite in nature. We establish similar results by using the device-independent success probability of Hardy?s nonlocality argument for tripartite quantum systems. We construct an example of a tripartite Hardy correlation which is postquantum but satisfies not only the all-bipartite information principle but also the guess-your-neighbor?s-input (GYNI) inequality.
منابع مشابه
On bound entanglement assisted distillation
We investigate asymptotic distillation of entanglement in the presence of an unlimited amount of bound entanglement for bi-partite systems. We show that the distillability is still bounded by the relative entropy of entanglement. This offers a strong support to the fact that bound entanglement does not improve distillation of entanglement. PACS number(s): 03.65.Bz, 89.70.+c,89.80.+h keywords: e...
متن کاملAnonymous quantum nonlocality.
We investigate the phenomenon of anonymous quantum nonlocality, which refers to the existence of multipartite quantum correlations that are not local in the sense of being Bell-inequality-violating but where the nonlocality is--due to its biseparability with respect to all bipartitions--seemingly nowhere to be found. Such correlations can be produced by the nonlocal collaboration involving defi...
متن کاملMulti-partite entanglement, communication complexity and quantum Helly-type theorems
We develop protocols for preparing the GHZ state (a pure tri-partite maximally entangled state) and, in general, a pure n-partite maximally entangled state using EPR pairs shared amongst n agents and classical communication between the agents. We observe that the combinatorial arrangement of EPR pairs required for this purpose is like that in Helly-type theorems in geometry. PACS numbers: 03.65...
متن کاملThe tight bound on the number of C_3-free vertices on regular 3-partite tournaments
Let T be a 3-partite tournament. We say that a vertex v is −→ C3-free if v does not lie on any directed triangle of T . Let F3(T ) be the set of the −→ C3-free vertices in a 3-partite tournament and f3(T ) its cardinality. In a recent paper, it was proved that if T is a regular 3-partite tournament, then f3(T ) < n 9 , where n is the order of T . In this paper, we prove that f3(T ) ≤ n 12 . We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Quantum Information Processing
دوره 12 شماره
صفحات -
تاریخ انتشار 2013