ﻻ يوجد ملخص باللغة العربية
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, independently, 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
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
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 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
We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions and n-qub