Abstract Quantum communication enables secure information transmission and entanglement distribution, but these tasks are fundamentally limited by the capacities of quantum channels. While quantum repeaters can mitigate losses and noise, entanglement swapping via a central node is ineffective against the Pauli dephasing channel due to degradation from Bell-state measurements. This suggests that purifying distributed Bell states before entanglement swapping is necessary. Although one-way hashing codes are known to saturate the dephasing channel capacity, no explicit two-way purification protocol has previously been shown to achieve this bound. In this work, we present a two-way entanglement purification protocol with an explicit, scalable circuit that asymptotically achieves the dephasing channel capacity. With each iteration, the fidelity of Bell states increases. At the final round, the residual dephasing error is suppressed doubly-exponentially, scaling as O ( p 2 n ) , enabling near-perfect Bell pairs for any fixed number of purification rounds n . The explicit circuit we propose is versatile and applicable to any number of Bell pairs, offering a practical solution for mitigating decoherence in quantum networks and distributed quantum computing.
Abstract Quantum communication enables secure information transmission and entanglement distribution, but these tasks are fundamentally limited by the capacities of quantum channels. While quantum repeaters can mitigate losses and noise, entanglement swapping via a central node is ineffective against the Pauli dephasing channel due to degradation from Bell-state measurements. This suggests that purifying distributed Bell states before entanglement swapping is necessary. Although one-way hashing codes are known to saturate the dephasing channel capacity, no explicit two-way purification protocol has previously been shown to achieve this bound. In this work, we present a two-way entanglement purification protocol with an explicit, scalable circuit that asymptotically achieves the dephasing channel capacity. With each iteration, the fidelity of Bell states increases. At the final round, the residual dephasing error is suppressed doubly-exponentially, scaling as O ( p 2 n ) , enabling near-perfect Bell pairs for any fixed number of purification rounds n . The explicit circuit we propose is versatile and applicable to any number of Bell pairs, offering a practical solution for mitigating decoherence in quantum networks and distributed quantum computing.
High-fidelity quantum entanglement is a key resource for quantum communication and distributed quantum computing, enabling quantum state teleportation, dense coding, and quantum encryption. Any sources of decoherence in the communication channel, however, degrade entanglement fidelity, thereby increasing the error rates of entangled state protocols. Entanglement purification provides a method to alleviate these nonidealities by distilling impure states into higher-fidelity entangled states. Here we demonstrate the entanglement purification of Bell pairs shared between two remote superconducting quantum nodes connected by a moderately lossy, 1-meter long superconducting communication cable. We use a purification process to correct the dominant amplitude damping errors caused by transmission through the cable, with fractional increases in fidelity as large as 25%, achieved for higher damping errors. The best final fidelity the purification achieves is 94.09±0.98%. In addition, we use both dynamical decoupling and Rabi driving to protect the entangled states from local noise, increasing the effective qubit dephasing time by a factor of 4, from 3 to 12 μs. These methods demonstrate the potential for the generation and preservation of very high-fidelity entanglement in a superconducting quantum communication network.
Entanglement distillation, a fundamental building block of quantum networks, enables the purification of noisy entangled states shared among distant nodes by local operations and classical communication. Its practical realization presents several technical challenges, including the storage of quantum states in quantum memory and the execution of coherent quantum operations on multiple copies of states within the quantum memory. In this work, we present an entanglement purification protocol via quantum communication, namely a carrier-assisted entanglement purification protocol, which utilizes two elements only: i) quantum memory for a single-copy entangled state shared by parties and ii) single qubits travelling between parties. We show that the protocol, when single-qubit transmission is noiseless, can purify a noisy entangled state shared by parties. When single-qubit transmission is noisy, the purification relies on types of noisy qubit channels; we characterize Pauli channels such that the protocol works for the purification. We address this limitation by using multiple carrier qubits, and show that for any non-entanglement-breaking Pauli channel, the protocol's fixed-point fidelity approaches unity as the number of carriers increases. Our results significantly reduce the experimental overhead required for distilling entanglement: the practical advantage is demonstrated through parameters directly related to the capability of entanglement purification, such as noise in quantum memory, local measurements, channel use, and entanglement fidelity. We envisage that the protocol would make long-distance pure entanglement closer to a practical realization.
Quantum communications enable secure key transmission and entanglement distribution, but their rates and maximum transmission distances are limited due to the losses and noise introduced by quantum channels. Various techniques have been developed to address these limitations, tailored to the platform and the nature of the decoherence. In this thesis, we explore ways to enhance the performance of quantum communications, with a particular focus on increasing the key rates and transmission distances in quantum key distribution (QKD), a method that leverages quantum mechanics to securely share keys between trusted parties. Additionally, we aim to improve the purity of entangled states shared between two parties, contributing to broader advancements in quantum communications. We begin by introducing a software-enhanced continuous-variable QKD (CV-QKD) protocol, where keys are encoded onto the phase and amplitude degrees of the optical field. This protocol enhances both transmission distance and key rates through a post-selection method employing arbitrary filters, experimentally demonstrated on two different platforms. Its adaptability makes it highly promising, as it can be implemented on existing CV-QKD platforms and dynamically optimises key rates for rapidly changing channels. We then present a protocol for the pure-loss channel leveraging quantum repeaters to mitigate the channel losses by segmenting the total communication distance into smaller, more manageable intervals. This repeater-like protocol introduces a more efficient entanglement-swapping measurement at the repeater station than the state-of-the-art twin-field protocols. Instead of polarisation encoding, our protocol relies on encoding keys in the photon-number basis, optimising the states to achieve the highest key rates for each distance. Notably, this protocol shows strong potential for improving long-distance quantum communication by surpassing the capacity of the direct communication channel at a shorter distance than the existing repeater protocols such as twin-field QKD while achieving an overall higher transmission distance. Finally, in this thesis, we demonstrate that for the Pauli-dephasing channel, placing a node in the middle of the quantum channel to perform a Bell-state measurement as an entanglement-swapping operation does not result in improved key rates, even with reduced decoherence. As a result, we propose an entanglement purification protocol that refines a larger set of noisy entangled states into a smaller set of high-fidelity ones using local operations and classical communication. This purification protocol builds upon earlier purification methods, extending their application from two Bell pairs to any number of Bell pairs and thereby achieving the capacity of the dephasing channel. Through numerous recursive iterations, it produces near-perfect Bell pairs, making it well-suited for quantum repeaters and correcting dephasing errors in quantum computers.
In this paper, we propose a novel bipartite entanglement purification protocol built upon hashing and upon the guessing random additive noise decoding (GRAND) approach recently devised for classical error correction codes. Our protocol offers substantial advantages over existing hashing protocols, requiring fewer qubits for purification, achieving higher fidelities, and delivering better yields with reduced computational costs. We provide numerical and semi-analytical results to corroborate our findings and provide a detailed comparison with the hashing protocol of Bennet et al. Although that pioneering work devised performance bounds, it did not offer an explicit construction for implementation. The present work fills that gap, offering both an explicit and more efficient purification method. We demonstrate that our protocol is capable of purifying states with noise on the order of 10% per Bell pair even with a small ensemble of 16 pairs. The work explores a measurement-based implementation of the protocol to address practical setups with noise. This work opens the path to practical and efficient entanglement purification using hashing-based methods with feasible computational costs. Compared to the original hashing protocol, the proposed method can achieve some desired fidelity with a number of initial resources up to one hundred times smaller. Therefore, the proposed method seems well-fit for future quantum networks with a limited number of resources and entails a relatively low computational overhead.
Entanglement purification with two entangled resource pairs is widely employed in the literature on quantum repeater networks to counteract fidelity degradation introduced by noisy quantum memories and entanglement swapping across multiple hops. Standard purification protocols assume both resource pairs carry identical fidelity. In practice, entanglement generation is stochastic, the two resource pairs are heralded at different times, and so the first pair decoheres in memory while the second is being generated. Thus a fidelity asymmetry is a structural feature of any network operating under realistic memory conditions, leading to the question: when is it beneficial to perform purification? We derive a closed-form fidelity asymmetry tolerance delta(F) that governs whether a purification attempt is beneficial. We determine a universal upper bound delta_max of approximately 0.076 beyond which purification is always counterproductive. Our simulations show that with exponential memory decoherence, purification yields benefits in only approximately 14% of purification attempts on two resource pairs in a two-hop repeater chain. We define three network objectives: fidelity only, time only, and a combination of time and fidelity, to deliver end-to-end entanglement. We show that when the application fidelity requirement is achievable through swapping alone, no-purification is the superior policy, with its advantage increasing with the number of hops. When the fidelity requirement cannot be met with swapping alone and purification is necessary, to be effective, it must be conditioned on delta(F) between resource pairs. We introduce DeltaPurify, a policy that conditions purification decisions on local fidelity information, and show it reduces time-to-serve relative to both naive purification and no-purification across several fidelity thresholds and hops of a repeater chain.
Entanglement purification protocols promise to play a critical role in the future of quantum networks by distributing entanglement across noisy channels. However, only the security of two-way purification protocols have been closely studied. To address this, we propose a one-way entanglement purification protocol which utilizes quantum sampling and prove its security against an adversary restricted to single qubit Pauli gates. This is done through leveraging the equivalence of one-way entanglement purification protocols with error-correcting codes. To prove the security of this protocol, we first use the quantum sampling framework introduced by Bouman and Fehr to estimate the Hamming weight of the qubits which passed through the channel and then use the estimated relative Hamming weight ω to determine the amount of interference that Eve has subjected to the quantum channel. Since Eve is restricted to single qubit Pauli gates, the number of applied gates can be directly estimated using the Hamming weight. Estimating the number of adversarial single qubit gates, allows us to perform error correction and disentangle the logical qubit from Eve with probability 1−εquδ. Since this protocol allows communication only in one direction, the distance of the code must be decided before transmission, and therefore Bob will be forced to abort the protocol if he finds that Eve has applied more gates than the code can correct. One-way protocols may find use when communication is limited, or when we desire to decrease latency compared to the multiple rounds of communication needed in two-way protocols. Further research may investigate the security of this protocol against arbitrary single or multi-qubit gates to obtain security guarantees against a more general adversary.