We study entanglement swapping through nonmaximally entangled states. The combination of the standard protocol with an optimal scheme for quantum state discrimination leads to a reliable protocol for the conclusive probabilistic generation of maximally entangled states. A possible setup based on cold trapped ions is proposed.
We analyze entanglement swapping (ES) of partially entangled pure states with arbitrary Schmidt rank from the perspective of quantum state discrimination. It is shown that the standard deterministic ES protocol is related with an optimal minimum-error strategy. In this case the amount of entanglement of the states resulting from swapping is, in general, lower than the maximum achievable for the quantum channels involved. In this regard, we show that the ES protocol can be probabilistically improved resorting to optimal maximum-confidence (MC) discrimination strategy. Additionally, we show that the success probability of achieving entanglement above a prescribed value from standard deterministic ES can be increased by applying sequential MC measurements.
It is known that entanglement swapping can be used to realize entanglement purification. In this way, two particles belonging to different nonmaximally entangled pairs can be projected probabilistically to a maximally entangled state or to a less entangled state. In this paper, we show, when the less entangled state is obtained, then a maximally entangled state can be obtained probabilistically from this less entangled state if a unitary transformation is introduced locally. The probability of success of our scheme is equal to the entanglement of a single pair purification (if two original pairs are in the same nonmaximally entangled states) or to the smaller entanglement of a single pair purification of these two pairs (if two original pairs are not in the same nonmaximally entangled states). The advantage of our scheme is that no continuous indefinite iterative procedure is needed to achieve optimal purification.
The basic entanglement swapping protocol allows to achieve the main aim of deterministically projecting two qubits, which have never interacted, onto a maximally entangled state. For deterministic swapping the key ingredient is the maximal entanglement initially contained in two pairs of qubits and the ability to measure onto a Bell basis. In other words, the basic and deterministic entanglement swapping scheme involves three maximal level of entanglement. In this work we address probabilistic entanglement swapping processes performed with different amounts of initial entanglement. Besides, we suggest a non Bell measuring-basis, thus we introduce a third entanglement level in the process. Additionally, we propose the \emph{unambiguous state extraction} scheme as the local mechanism for probabilistically achieving the main aim. Amalgamating these three elements allows us to design four strategies for performing probabilistic entanglement swapping. Surprisingly, we encountered an twofold entanglement matching effect related to the concurrence of the measuring-basis. Specifically, the maximal probability of accomplishing the main aim becomes a constant for concurrences higher than or equal to the matching entanglement values. Thus, we show that maximal entanglement in the measuring-basis is not required for attaining the main aim with optimal probability.
Entanglement is known to be a powerful resource that improves performance in various quantum information and computational tasks. A standard example of such a phenomenon is the possibility of perfectly discriminating all four Pauli operations in a single shot via the superdense coding protocol. While entanglement is often a powerful resource for quantum channel discrimination, this is not necessarily the case. In this work, we identify scenarios in which the maximally entangled state is a bad choice of input state and, more generally, show that excessive entanglement can reduce channel discriminability dramatically. To do so, we present an explicit pair of unitary channels which are perfectly discriminable without entanglement, but for which any strategy with maximally entangled input states is ε-close to a blind uniform guessing strategy. To develop a systematic approach, we introduce the concepts of Maximal Entanglement Worst Case (MEWC) and Maximal Entanglement Best Case (MEBC) pairs of channels, and present conditions for a pair of channels to be MEWC or MEBC. With these conditions, we show that the optimal input states for discriminating MEWC pairs of channels are necessarily separable, and provide non-trivial examples of measurement channels for which entanglement necessarily reduces the maximum probability of discrimination.