Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2511.09657 · Physical Review A

Optimal Interpolation of Entanglement Purification Protocols

Matthew Barber, Stefano Pirandola

quant-phmath-phphysics.comp-phphysics.opticsSubmitted Nov 12, 2025• Announced Nov 14, 2025• 0 citations• Revised Aug 13, 2026 (v2)
v1 · Nov 12, 2025v2 · Aug 13, 2026
arXivHTMLPDF

Abstract

Bipartite entanglement purification is the conversion of copies of weakly entangled pairs shared between two separated parties into a smaller number of strongly entangled shared pairs using only local operations and classical communication. Choosing between different entanglement purification protocols generally involves weighing up a trade-off between the ratio of strongly entangled pairs produced to weakly entangled pairs consumed, which we call the rate of the protocol, and the degree of the entanglement of the strongly entangled pairs, typically measured by the fidelity of those pairs to maximally entangled states. By randomly choosing a protocol according to a probability distribution over a list of protocols for each pair we want to produce, we can achieve rates and fidelities not achieved by any of the original protocols. Here, we show how to choose this distribution to maximize the rate at which we produce qubit pairs with a given fidelity to a Bell state or, equivalently, to maximize the fidelity to a Bell state of the qubit pairs produced at a given rate. We investigate both the asymptotic case, where the number of initial pairs goes to infinity, and the finite-size regime, where protocols are restricted to a finite number of weakly entangled pairs.

Journal reference
Phys. Rev. A 114, 032416 (2026)
DOI
10.1103/v55w-6x44
Comments
Accepted in PRA. REVTeX. 15 pages

Related papers

Entanglement Cost of Optimal Distributed Quantum State Purification

Jiayi Zhao, Chengkai Zhu, Xin Wang +1 more

We determine the preshared entanglement required for spatially separated parties, restricted to local operations and classical communication, to attain globally optimal probabilistic two-copy purification of arbitrary bipartite pure states under depolarizing noise. In every local dimension $d\ge 2$, one shared maximally entangled qubit pair suffices: local controlled-SWAP operations exactly reproduce the globally optimal successful transformation. Conversely, any finite-dimensional preshared resource state that attains the same benchmark, even under a positive-partial-transpose relaxation, must have entanglement of formation at least one ebit. For pure resources with one ebit, or for two-qubit resources including mixed states, attaining the benchmark is possible only for states with exactly two nonzero Schmidt weights, both equal to $1/2$, namely those locally unitarily equivalent to a maximally entangled qubit pair. These findings provide a benchmark for evaluating the entanglement demands of noise management in quantum networks and modular quantum computers.

quant-pharXiv:2609.23441•Sep 22, 2026•0 citations

Entanglement purification by counting and locating errors with entangling measurements

Ferran Riera-Sàbat, Pavel Sekatski, Alexander Pirker +1 more

We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about the number and positions of errors in the noisy ensemble in an explicit and controlled way, thereby reducing the amount of noise in the ensemble and purifying the remaining states. This allows us to design entanglement purification protocols for any number of copies that work particularly well for a small number of expected errors, i.e., high fidelity of initial states. The main tool is a counter gate with which the required nonlocal information can be transferred into the high-dimensional entangled qudit auxiliary states. We compare our schemes to standard recurrence protocols that operate on pairs of copies, and hashing and breeding protocols that operate on a (asymptotically) large number of copies. Our protocols interpolate between these two regimes, leading to higher achievable fidelity and yield. We illustrate our approach for bipartite qubit states and generalize it to purify multiparty GHZ states.

arXiv:2011.07084•Physical Review A•Jul 21, 2021•28 citations

Optimized Entanglement Purification

Stefan Krastanov, Victor V. Albert, Liang Jiang

We investigate novel protocols for entanglement purification of qubit Bell pairs. Employing genetic algorithms for the design of the purification circuit, we obtain shorter circuits achieving higher success rates and better final fidelities than what is currently available in the literature. We provide a software tool for analytical and numerical study of the generated purification circuits, under customizable error models. These new purification protocols pave the way to practical implementations of modular quantum computers and quantum repeaters. Our approach is particularly attentive to the effects of finite resources and imperfect local operations - phenomena neglected in the usual asymptotic approach to the problem. The choice of the building blocks permitted in the construction of the circuits is based on a thorough enumeration of the local Clifford operations that act as permutations on the basis of Bell states.

arXiv:1712.09762•Quantum•Feb 18, 2019•99 citations

Purification of the residual entanglement

Lan Zhou, Wei Zhong, Yu‐Bo Sheng

Entanglement purification is an indispensable ingredient in extended quantum communication networks and usually determines the efficiency and communication rate of quantum communication protocols. Different from all existing entanglement purification protocols (EPPs) where two or more copies of low quality mixed entangled states are selected from the same ensemble, here we describe a general and optimal EPP for arbitrary initial mixed states from different ensembles. We show that the successful operation of EPP may not obtain a higher fidelity mixed state, while the discarded source pair, which is usually regarded as a failure in existing EPPs, may have residual entanglement and can be reused to increase the yield of entanglement purification. We give the criterions of both the successful purification to obtain a higher fidelity mixed state and the existence of residual entanglement. Moreover, we reveal that entanglement purification procedure causes some entanglement loss. Finally, we provide an optimal approach to reduce the entanglement loss. This approach can also be used to increase the yield of entanglement purification. Our EPP may have potential application in long-distance quantum communications.

Optics Express•Dec 31, 2019•58 citations

Efficient entanglement purification based on noise guessing decoding

André Roque, Diogo Cruz, Francisco A. Monteiro +1 more

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.

arXiv:2310.19914•Quantum•Sep 19, 2024•4 citations

Optimal Continuous- to Discrete-Variable Bipartite Entanglement Conversion

Pak-Tik Fong, Ruchir Tullu, Hoi-Kwan Lau

Discrete-variable (DV) entanglement is crucial for numerous quantum applications, yet its deterministic generation in many bosonic systems remains experimentally challenging. In contrast, continuous-variable (CV) entanglement can be produced efficiently. We propose two optimal schemes for converting CV bipartite entanglement into DV entanglement using only local operations and classical communication. The first scheme extracts maximally entangled qubit pairs at the theoretically maximal rate, while the second probabilistically produces a maximally entangled qudit pair with the highest average entanglement. In both schemes, we quantify the optimal performance and identify the measurement operators required for implementation. Notably, using only a sequence of binary measurements, our approach can succeed in a finite number of measurement rounds on average, even though the CV resource is infinite-dimensional. Our schemes improve the feasibility of implementing DV-based quantum technologies on bosonic platforms.

quant-pharXiv:2603.12682•Mar 16, 2026•0 citations
Bipartite entanglement purification is the conversion of copies of weakly entangled pairs shared between two separated parties into a smaller number of strongly entangled shared pairs using only local operations and classical communication. Choosing between different entanglement purification protocols generally involves weighing up a trade-off between the ratio of strongly entangled pairs produced to weakly entangled pairs consumed, which we call the rate of the protocol, and the degree of the entanglement of the strongly entangled pairs, typically measured by the fidelity of those pairs to maximally entangled states. By randomly choosing a protocol according to a probability distribution over a list of protocols for each pair we want to produce, we can achieve rates and fidelities not achieved by any of the original protocols. Here, we show how to choose this distribution to maximize the rate at which we produce qubit pairs with a given fidelity to a Bell state or, equivalently, to maximize the fidelity to a Bell state of the qubit pairs produced at a given rate. We investigate both the asymptotic case, where the number of initial pairs goes to infinity, and the finite-size regime, where protocols are restricted to a finite number of weakly entangled pairs.
We determine the preshared entanglement required for spatially separated parties, restricted to local operations and classical communication, to attain globally optimal probabilistic two-copy purification of arbitrary bipartite pure states under depolarizing noise. In every local dimension d≥2d\ge 2d≥2, one shared maximally entangled qubit pair suffices: local controlled-SWAP operations exactly reproduce the globally optimal successful transformation. Conversely, any finite-dimensional preshared resource state that attains the same benchmark, even under a positive-partial-transpose relaxation, must have entanglement of formation at least one ebit. For pure resources with one ebit, or for two-qubit resources including mixed states, attaining the benchmark is possible only for states with exactly two nonzero Schmidt weights, both equal to 1/21/21/2, namely those locally unitarily equivalent to a maximally entangled qubit pair. These findings provide a benchmark for evaluating the entanglement demands of noise management in quantum networks and modular quantum computers.
We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about the number and positions of errors in the noisy ensemble in an explicit and controlled way, thereby reducing the amount of noise in the ensemble and purifying the remaining states. This allows us to design entanglement purification protocols for any number of copies that work particularly well for a small number of expected errors, i.e., high fidelity of initial states. The main tool is a counter gate with which the required nonlocal information can be transferred into the high-dimensional entangled qudit auxiliary states. We compare our schemes to standard recurrence protocols that operate on pairs of copies, and hashing and breeding protocols that operate on a (asymptotically) large number of copies. Our protocols interpolate between these two regimes, leading to higher achievable fidelity and yield. We illustrate our approach for bipartite qubit states and generalize it to purify multiparty GHZ states.
We investigate novel protocols for entanglement purification of qubit Bell pairs. Employing genetic algorithms for the design of the purification circuit, we obtain shorter circuits achieving higher success rates and better final fidelities than what is currently available in the literature. We provide a software tool for analytical and numerical study of the generated purification circuits, under customizable error models. These new purification protocols pave the way to practical implementations of modular quantum computers and quantum repeaters. Our approach is particularly attentive to the effects of finite resources and imperfect local operations - phenomena neglected in the usual asymptotic approach to the problem. The choice of the building blocks permitted in the construction of the circuits is based on a thorough enumeration of the local Clifford operations that act as permutations on the basis of Bell states.
Entanglement purification is an indispensable ingredient in extended quantum communication networks and usually determines the efficiency and communication rate of quantum communication protocols. Different from all existing entanglement purification protocols (EPPs) where two or more copies of low quality mixed entangled states are selected from the same ensemble, here we describe a general and optimal EPP for arbitrary initial mixed states from different ensembles. We show that the successful operation of EPP may not obtain a higher fidelity mixed state, while the discarded source pair, which is usually regarded as a failure in existing EPPs, may have residual entanglement and can be reused to increase the yield of entanglement purification. We give the criterions of both the successful purification to obtain a higher fidelity mixed state and the existence of residual entanglement. Moreover, we reveal that entanglement purification procedure causes some entanglement loss. Finally, we provide an optimal approach to reduce the entanglement loss. This approach can also be used to increase the yield of entanglement purification. Our EPP may have potential application in long-distance quantum communications.
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.
Discrete-variable (DV) entanglement is crucial for numerous quantum applications, yet its deterministic generation in many bosonic systems remains experimentally challenging. In contrast, continuous-variable (CV) entanglement can be produced efficiently. We propose two optimal schemes for converting CV bipartite entanglement into DV entanglement using only local operations and classical communication. The first scheme extracts maximally entangled qubit pairs at the theoretically maximal rate, while the second probabilistically produces a maximally entangled qudit pair with the highest average entanglement. In both schemes, we quantify the optimal performance and identify the measurement operators required for implementation. Notably, using only a sequence of binary measurements, our approach can succeed in a finite number of measurement rounds on average, even though the CV resource is infinite-dimensional. Our schemes improve the feasibility of implementing DV-based quantum technologies on bosonic platforms.