No Arabic abstract
The entanglement resource required for quantum information processing comes in a variety of forms, from Bell states to multipartite GHZ states or cluster states. Purifying these resources after their imperfect generation is an indispensable step towards using them in quantum architectures. While this challenge, both in the case of Bell pairs and more general multipartite entangled states, is mostly overcome in the presence of perfect local quantum hardware with unconstrained qubit register sizes, devising optimal purification strategies for finite-size realistic noisy hardware has remained elusive. Here we depart from the typical purification paradigm for multipartite states explored in the last twenty years. We present cases where the hardware limitations are taken into account, and surprisingly find that smaller `sacrificial states, like Bell pairs, can be more useful in the purification of multipartite states than additional copies of these same states. This drastically simplifies the requirements and presents a fundamentally new pathway to leverage near term networked quantum hardware.
Multipartite entanglement plays an important role in controlled quantum teleportation, quantum secret sharing, quantum metrology and some other important quantum information branches. However, the maximally multipartite entangled state will degrade into the mixed state because of the noise. We present an efficient multipartite entanglement purification protocol (EPP) which can distill the high quality entangled states from low quality entangled states for N-photon systems in a Greenberger-Horne-Zeilinger (GHZ) state in only linear optics. After performing the protocol, the spatial-mode entanglement is used to purify the polarization entanglement and one pair of high quality polarization entangled state will be obtained. This EPP has several advantages. Firstly, with the same purification success probability, this EPP only requires one pair of multipartite GHZ state, while existing EPPs usually require two pairs of multipartite GHZ state. Secondly, if consider the practical transmission and detector efficiency, this EPP may be extremely useful for the ratio of purification efficiency is increased rapidly with both the number of photons and the transmission distance. Thirdly, this protocol requires linear optics and does not add additional measurement operations, so that it is feasible for experiment. All these advantages will make this protocol have potential application for future quantum information processing.
High-quality long-distance entanglement is essential for both quantum communication and scalable quantum networks. Entanglement purification is to distill high-quality entanglement from low-quality entanglement in a noisy environment and it plays a key role in quantum repeaters. The previous significant entanglement purification experiments require two pairs of low-quality entangled states and were demonstrated in table-top. Here we propose and report a high-efficiency and long-distance entanglement purification using only one pair of hyperentangled states. We also demonstrate its practical application in entanglement-based quantum key distribution (QKD). One pair of polarization spatial-mode hyperentanglement was distributed over 11 km multicore fiber (noisy channel). After purification, the fidelity of polarization entanglement arises from 0.771 to 0.887 and the effective key rate in entanglement-based QKD increases from 0 to 0.332. The values of Clauser-Horne-Shimony-Holt (CHSH) inequality of polarization entanglement arises from 1.829 to 2.128. Moreover, by using one pair of hyperentanglement and deterministic controlled-NOT gate, the total purification efficiency can be estimated as 6.6x10^3 times than the experiment using two pairs of entangled states with spontaneous parametric down-conversion (SPDC) sources. Our results offer the potential to be implemented as part of a full quantum repeater and large scale quantum network.
We give a review on entanglement purification for bipartite and multipartite quantum states, with the main focus on theoretical work carried out by our group in the last couple of years. We discuss entanglement purification in the context of quantum communication, where we emphasize its close relation to quantum error correction. Various bipartite and multipartite entanglement purification protocols are discussed, and their performance under idealized and realistic conditions is studied. Several applications of entanglement purification in quantum communication and computation are presented, which highlights the fact that entanglement purification is a fundamental tool in quantum information processing.
A new entanglement measure, the multiple entropy measures (MEMS), is proposed to quantify quantum entanglement of multi-partite quantum state. The MEMS is vector-like with $m=[N/2]$, the integer part of $N/2$, components: $[S_1, S_2,..., S_m]$, and the $i$-th component $S_i$ is the geometric mean of $i$-body partial entropy of the system. The $S_i$ measures how strong an arbitrary $i$ bodies from the system are entangled with the rest of the system. The MEMS is not only transparent in physical picture, but also simple to calculate. It satisfies the conditions for a good entanglement measure. We have analyzed the entanglement properties of the GHZ-state, the W-states and cluster-states under MEMS. The cluster-state is more entangled than the GHZ-state and W-state under MEMS.
We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We explore how network parameters influence the performance of path-finding algorithms necessary for optimizing routing and, in particular, we explore the interplay between the bandwidth of a quantum channels and the choice of purification protocol. Finally, we demonstrate multi-path routing on various network topologies with resource constraints, in an effort to inform future design choices for quantum network configurations. Our work optimizes both the choice of path over the quantum network and the choice of purification schemes used between nodes. We consider not only pair-production rate, but optimize over the fidelity of the delivered entangled state. We introduce effective heuristics enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network, with performance comparable to that of a computationally-expensive brute-force path search.