Entanglement Purification via Entanglement Swapping

Li‐Yi Hsu

홍정식

Run-Ze Cong, Shuang Xu

We study the entanglement purification via entanglement swapping in terms of optimal output state concurrence. A strict formula that governs the process is first given analytically for the case where both input entangled pairs are in arbitrary pure states. Then, it is generalized, with strong numerical evidence, to the case with one of the entangled pairs being in an arbitrary mixed state. The formula subsequently gives a formal upper bound of entanglement purification via entanglement swapping, as well as how the maximum entanglement purification can be attained by engineering the pure state entangled pair. Moreover, the formalism of the upper bound in turn suggests that entanglement swapping is most suited for reducing the influence of pure dissipative noise, which can be applied to extend the lifespan of stationary qubits in quantum communications.

Iordanis Koutsopoulos

We study the problem of entanglement distribution in terms of maximizing a utility function that captures the total fidelity of end-to-end entanglements in a two-link linear quantum network with a source, a repeater, and a destination. The nodes have several quantum memories, and the problem is how to coordinate entanglement purification in each of the links, and entanglement swapping across links so as to achieve the goal above. We show that entanglement swapping (i.e, deciding on the pair of qubits from each link to perform swapping on) is equivalent to finding a max-weight matching on a bipartite graph. Further, entanglement purification (i.e, deciding which pairs of qubits in a link will undergo purification) is equivalent to finding a max-weight matching on a non-bipartite graph. We propose two polynomial algorithms, the Purify-then-Swap (PtS) and the Swap-then-Purify (StP) ones, where the decisions about purification and swapping are taken with different order. Numerical results show that PtS performs better than StP, and that the omission of purification in StP gives substantial benefits.

H. J. Briegel, B. Hüttner, N. Gisin +10 more

Jin-Yuan Hsieh, Che‐Ming Li, Der-San Chuu