Quantum entanglement among remote agents is a key enabler for many important quantum communication operations. To establish entanglement between two remote agents, one agent can locally generate entangled qubit pairs and transmit one of the qubits in each pair to the other agent through quantum channels. However, the transmitted qubits will inevitably be contaminated by the noise inherent in the quantum channels. To address this challenge, quantum entanglement distillation (QED) algorithms have been developed to generate highly-entangled qubit pairs from many contaminated ones. Nevertheless, existing algorithms either have low efficiency or require large-scale quantum circuits. This paper focuses on phase-damping channel and proposes an efficient QED algorithm that only require small- scale quantum circuit.
Quantum entanglement among remote agents is a key enabler for many important quantum communication operations. To establish entanglement between two remote agents, one agent can locally generate entangled qubit pairs and transmit one of the qubits in each pair to the other agent through quantum channels. However, the transmitted qubits will inevitably be contaminated by the noise inherent in the quantum channels. To address this challenge, quantum entanglement distillation (QED) algorithms have been developed to generate highly-entangled qubit pairs from many contaminated ones. Nevertheless, existing algorithms either have low efficiency or require large-scale quantum circuits. This paper focuses on phase-damping channel and proposes an efficient QED algorithm that only require small- scale quantum circuit.
Quantum entanglement serves as a valuable resource for many important quantum operations. A pair of entangled qubits can be shared between two agents by first preparing a maximally entangled qubit pair at one agent, and then sending one of the qubits to the other agent through a quantum channel. In this process, the deterioration of entanglement is inevitable since the noise inherent in the channel contaminates the qubit. To address this challenge, various quantum entanglement distillation (QED) algorithms have been developed. Among them, recurrence algorithms have advantages in terms of implementability and robustness. However, the efficiency of recurrence QED algorithms has not been investigated thoroughly in the literature. This paper puts forth two recurrence QED algorithms that adapt to the quantum channel to tackle the efficiency issue. The proposed algorithms have guaranteed convergence for quantum channels with two Kraus operators, which include phase-damping and amplitude-damping channels. Analytical results show that the convergence speed of these algorithms is improved from linear to quadratic and one of the algorithms achieves the optimal speed. Numerical results confirm that the proposed algorithms significantly improve the efficiency of QED.
Quantum entanglement serves as a valuable resource for many important quantum operations. To address challenge brought by the noise in the quantum channel, various quantum entanglement distillation (QED) algorithms have been developed. Among them, recurrence algorithms have advantages in terms of implementability and robustness. However, the efficiency of recurrence QED algorithms has not been investigated thoroughly in the literature. To enable efficient QED algorithms, it is essential to increase the fidelity of the qubit pairs obtained in each rounds of distillation, so as to reduce the rounds of distillation required. This paper considers two-Kraus-operator (TKO) channels, a class that covers several typical quantum channels, characterizes the optimal fidelity achievable by QED operations in each round, and designs recurrence algorithms which achieve the optimal fidelity.
Quantum entanglement shared by remote network nodes serves as a valuable resource for promising applications in distributed computing, cryptography, and sensing. However, distributing high-quality entanglement via fiber-optic routes could be challenging due to the various decoherence mechanisms in fibers. In particular, one of the primary polarization decoherence mechanisms in optical fibers is polarization mode dispersion (PMD), which is the distortion of optical pulses by randomly varying birefringences. To mitigate the effect of decoherence in entangled particles, quantum entanglement distillation (QED) algorithms have been proposed. One particular class, the recurrence QED algorithms, stands out because it has relatively relaxed requirements both on the size of the quantum circuits involved and on the initial quality of entanglement between particles. However, because the number of required particles grows exponentially with the number of distillation rounds, an efficient recurrence algorithm needs to converge quickly. We present a recurrence QED algorithm designed for photonic qubit pairs affected by PMD-degraded channels. Our proposed algorithm achieves the optimal fidelity as well as the optimal success probability (conditioned on the fact that optimal fidelity is achieved) in every round of distillation. The attainment of the maximal fidelity improves the convergence speed of fidelity with respect to the number of distillation rounds from linear to quadratic and, hence, significantly reduces the number of rounds. Combined with the fact that the optimal success probability is achieved, the proposed algorithm provides an efficient method to distribute entangled states with a high fidelity via optical fibers.
Quantum entanglement shared by remote network nodes serves as a valuable resource for promising applications in distributed computing, cryptography, and sensing. However, distributing entanglement with high-quality via fiber optic routes could be challenging due to the various decoherence mechanisms in fibers. In particular, one of the primary polarization decoherence mechanisms in optical fibers is polarization mode dispersion (PMD), which is the distortion of optical pulses by randomly varying birefringences in the system. To mitigate the effect of decoherence in entangled particles, quantum entanglement distillation (QED) algorithms have been proposed. One particular class, the recurrence QED algorithms, stands out because it has relatively relaxed requirements on both the size of the quantum circuits involved and on the initial quality of entanglement in particles. However, because the number of particles required grows exponentially with the number of rounds of distillation, an efficient recurrence algorithm needs to converge quickly. We present a recurrence QED algorithm designed for photonic qubit pairs affected by PMD-degraded channels. Our proposed algorithm achieves the optimal fidelity as well as the optimal success probability (conditional on the optimal fidelity being achieved) in every round of distillation. The attainment of optimal fidelity improves the convergence speed of fidelity with respect to the rounds of distillation from linear to quadratic, and hence significantly reduces the number of distillation rounds. Combined with the fact that the optimal success probability is achieved, the proposed algorithm provides an efficient method to distribute entangled states with high fidelity via optic fibers.
High-fidelity entanglement shared between distant quantum systems is an essential resource for quantum communication and computation. Entanglement distillation addresses this need by converting multiple noisy Bell pairs into fewer higher-fidelity pairs, using only local quantum operations and classical communication. However, this approach typically requires a substantial overhead in the number of qubits. To bypass this hurdle, we propose to leverage the high-dimensional Hilbert space of a single pair of bosonic systems to store a large amount of entanglement, replacing the need for multi-qubit systems. To distill entanglement in such a setup, we devise a new entanglement distillation protocol, tailored for bosonic systems. The protocol converts a highly-entangled noisy state between two bosonic systems into a lower-dimensional but high-fidelity entangled state, using only local bosonic operations. We show that our protocol significantly enhances the fidelity of the entangled state in the presence of naturally occurring loss and dephasing errors. Compared to methods relying on multiple Bell pairs, our scheme offers a more hardware-efficient strategy, providing a practical route toward the realization of entanglement distillation.
Entanglement is essential for quantum information processing, but is limited by noise. We address this by developing high-yield entanglement distillation protocols with several advancements. (1) We extend the 2-to-1 recurrence entanglement distillation protocol to higher-rate n -to- ( n − 1 ) protocols that can correct any single-qubit errors. These protocols are evaluated through numerical simulations focusing on fidelity and yield. We also outline a method to adapt any classical error-correcting code for entanglement distillation, where the code can correct both bit-flip and phase-flip errors by incorporating Hadamard gates. (2) We propose a constant-depth decoder for stabilizer codes that transforms logical states into physical ones using single-qubit measurements. This decoder is applied to entanglement distillation protocols, reducing circuit depth and enabling protocols derived from high-performance quantum error-correcting codes. We demonstrate this by evaluating the circuit complexity for entanglement distillation protocols based on surface codes and quantum convolutional codes. (3) Our stabilizer entanglement distillation techniques advance quantum computing. We propose a fault-tolerant protocol for constant-depth encoding and decoding of arbitrary states in surface codes, with potential extensions to more general quantum low-density parity-check codes. This protocol is feasible with state-of-the-art reconfigurable atom arrays and surpasses the limits of conventional logarithmic depth encoders. Overall, our study integrates stabilizer formalism, measurement-based quantum computing, and entanglement distillation, advancing both quantum communication and computing.