اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDetecting the local indistinguishability of maximally entangled states
269
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
By incorporating the asymmetry of local protocols, i.e., some party has to start with a nontrivial measurement, into an operational method of detecting the local indistinguishability proposed by Horodecki {it et al.} [Phys.Rev.Lett. 90 047902 (2003)], we derive a computable criterion to efficiently detect the local indistinguishability of maximally entangled states. Locally indistinguishable sets of $d$ maximally entangled states in a $dotimes d$ system are systematically constructed for all $dge 4$ as an application. Furthermore, by exploiting the fact that local protocols are necessarily separable, we explicitly construct small sets of $k$ locally indistinguishable maximally entangled states with the ratio $k/d$ approaching 3/4. In particular, in a $dotimes d$ system with even $dge 6$, there always exist $d-1$ maximally entangled states that are locally indistinguishable by separable measurements.
قيم البحث
اقرأ أيضاً
In this paper we describe a test of Bell inequalities using a non- maximally entangled state, which represents an important step in the direction of eliminating the detection loophole. The experiment is based on the creation of a polarisation entangl
ed state via the superposition, by use of an appropriate optics, of the spontaneous fluorescence emitted by two non-linear crystals driven by the same pumping laser.
Entanglement swapping has played an important role in quantum information processing, and become one of the necessary core technologies in the future quantum network. In this paper, we study entanglement swapping for multi-particle pure states and ma
ximally entangled states in qudit systems. We generalize the entanglement swapping of two pure states from the case where each quantum system contains two particles to the case of containing any number of particles, and consider the entanglement swapping between any number of systems. We also generalize the entanglement swapping chain of bipartite pure states to the one of multi-particle pure states. In addition, we consider the entanglement swapping chains for maximally entangled states.
We propose a scheme for long-distance quantum communication where the elementary entanglement is generated through two-photon interference and quantum swapping is performed through one-photon interference. Local polarization maximally entangled state
s of atomic ensembles are generated by absorbing a single photon from on-demand single-photon sources. This scheme is robust against phase fluctuations in the quantum channels, moreover speeds up long-distance high-fidelity entanglement generation rate.
We investigate sharing of bipartite entanglement in a scenario where half of an entangled pair is possessed and projectively measured by one observer, called Alice, while the other half is subjected to measurements performed sequentially, independent
ly, and unsharply, by multiple observers, called Bobs. We find that there is a limit on the number of observers in this entanglement distribution scenario. In particular, for a two-qubit maximally entangled initial shared state, no more than twelve Bobs can detect entanglement with a single Alice for arbitrary -- possibly unequal -- sharpness parameters of the measurements by the Bobs. Moreover, the number of Bobs remains unaltered for a finite range of near-maximal pure initial entanglement, a feature that also occurs in the case of equal sharpness parameters at the Bobs. Furthermore, we show that for non-maximally entangled shared pure states, the number of Bobs reduces with the amount of initial entanglement, providing a coarse-grained but operational measure of entanglement.
This paper considers a special class of nonlocal games $(G,psi)$, where $G$ is a two-player one-round game, and $psi$ is a bipartite state independent of $G$. In the game $(G,psi)$, the players are allowed to share arbitrarily many copies of $psi$. T
he value of the game $(G,psi)$, denoted by $omega^*(G,psi)$, is the supremum of the winning probability that the players can achieve with arbitrarily many copies of preshared states $psi$. For a noisy maximally entangled state $psi$, a two-player one-round game $G$ and an arbitrarily small precision $epsilon>0$, this paper proves an upper bound on the number of copies of $psi$ for the players to win the game with a probability $epsilon$ close to $omega^*(G,psi)$. Hence, it is feasible to approximately compute $omega^*(G,psi)$ to an arbitrarily precision. Recently, a breakthrough result by Ji, Natarajan, Vidick, Wright and Yuen showed that it is undecidable to approximate the values of nonlocal games to a constant precision when the players preshare arbitrarily many copies of perfect maximally entangled states, which implies that $mathrm{MIP}^*=mathrm{RE}$. In contrast, our result implies the hardness of approximating nonlocal games collapses when the preshared maximally entangled states are noisy. The paper develops a theory of Fourier analysis on matrix spaces by extending a number of techniques in Boolean analysis and Hermitian analysis to matrix spaces. We establish a series of new techniques, such as a quantum invariance principle and a hypercontractive inequality for random operators, which we believe have further applications.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
