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

IEEE Networking Letters

On the Non-Symmetric Entanglement Purification Strategies in Quantum Networks

Joy Halder, Hilal Sultan Duranoglu Tunc, Riccardo Bassoli, Frank H. P. Fitzek, Gerhard Paul Fettweis

Published Jan 1, 2026• 0 citations
Publisher

Abstract

This work considers the problem of entanglement purification for the bit/phase flip channel model in quantum networks. The non-symmetric purification model is considered, where Bell pairs are distributed between adjacent node pairs with distinct fidelity values. Two purification methods are proposed for the non-symmetric purification model with the objective of maximizing the number of Bell pairs with fidelity value beyond the threshold fidelity. The properties of these methods are mathematically analyzed and supported by extensive simulation results. It is observed that the proposed methods have distinct properties and different applicability scenarios based on the input range of fidelity values and the fidelity threshold.

DOI
10.1109/lnet.2026.3742869

Related papers

Virtual Link Purification Strategy for Quantum Entanglement Networks

David Tavares, Diego Medeiros De Abreu, Antônio Gomes Abelém

End-to-end entanglement distribution in multi-hop quantum networks experiences fidelity degradation as entanglement swapping progresses over noisy and heterogeneous channels. In this paper, we propose a virtual-link purification strategy in which multiple EPR pairs are used at each stage to create virtual links between non-adjacent nodes and then purified in cascade using symmetric purification. The approach allows parameterizing the number of links per stage and follows a hierarchical design, with a more complete first stage and simplified purification in subsequent stages. We implement a time-slot-based orchestrator and compare the proposal against conventional swapping under Werner and bit-flip noise models. The results indicate higher end-to-end fidelity with virtual-link purification.

Simpósio Brasileiro de Computação e Comunicação Quânticas (SBCCQ)•Jul 19, 2026•0 citations

A Tailored Fidelity Estimation and Purification Method for Entangled Quantum Networks

Takafumi Oka, Michal Hajdušek, Shota Nagayama +1 more

We present a method to conduct both quantum state reconstruction and entanglement purification simultaneously that is advantageous in several respects over previous work in this direction, showing that the number of Bell pairs necessary to boot a quantum network can be significantly reduced compared to an existing method. The existing method requires at least $10^5$ Bell pairs for the state reconstruction phase to estimate that the state is of fidelity $0.99$ within the error range of $10^{-2}$, whereas our approach only requires around $2,841$ to be certain with $99.7\%$ of confidence that the estimated fidelity lies within $[0.99-0.01, 0.99+0.01]$. In addition, in our approach we can start with a lower fidelity Bell pair and purify it multiple times, estimating at the same time the resultant fidelity with guarantee of $99.7\%$ that the fidelity estimate lies within a certain range. Moreover, the existing method cannot correct both bit-flip and phase-flip errors at the same time and can only correct one of these, whereas our approach can correct both bit-flip and phase-flip errors simultaneously. This research produces numerical estimates for the number of Bell pairs actually needed to guarantee a certain threshold fidelity $F$. The research can support the functioning real-world quantum networking by providing the information of the time needed for the bootstrapping of a quantum network to finish.

quant-pharXiv:2602.18011•Feb 23, 2026•0 citations

To Purify or Not to Purify: Entanglement Purification under Input Fidelity Asymmetry in Quantum Networks

Anoosha Fayyaz, Prashant Krishnamurthy, Kaushik Seshadreesan +2 more

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.

quant-pharXiv:2605.08771•May 12, 2026•1 citation

Maximization of Entanglement Sharing in Quantum Communication Networks with Fidelity Requirements

Zain Ali, Zouheir Rezki, Hamid R. Sadjadpour

The unbreakable security and higher data rates offered by quantum communication networks have made quantum communication an inevitable necessity of the future. Many quantum communication frameworks, such as quantum key distribution and super dense coding, require entangled pairs to be shared between the source and destination nodes. Communication nodes in quantum networks have a minimum fidelity requirement for the entangled pairs. If the fidelity requirement is not satisfied, the entangled pairs may not be used for the desired operations. Successful sharing of the entangled pairs between the nodes is a crucial step in making quantum communication practical. In this work, we propose a framework to maximize entanglement sharing between a source and multiple destination nodes in a fair manner. We consider a system that takes advantage of the purification process to improve the fidelity of the entangled pairs when necessary. The proposed solution framework provides the optimal number of entangled pairs required for the purification process and the optimal transmission rate at the source node to achieve the desired system objective. The non-convex problem is first transformed into a convex form, and then a Lagrangian dual-based framework is proposed to find the optimal solution values. Moreover, to optimize the number of entangled pairs for purification at each link, we derive a closed-form expression that provides the optimal value in a single step. Selected simulation results demonstrate that the proposed framework exhibits excellent performance.

Globecom•Dec 8, 2024•1 citation

Near-Optimal Techniques for Distributed Entanglement Generation and Purification

Xiaojie Fan, Yukun Yang, C. R. Ramakrishnan +1 more

Abstract We address the problem of efficiently distributing high-fidelity entangled states across the nodes of a quantum network—a fundamental requirement for quantum communication, distributed quantum computing, and emerging quantum internet applications. We consider a repeater-based architecture that combines entanglement swapping (or fusion) with purification operations, which enhance fidelity by consuming additional entangled pairs. While prior work has explored routing and limited purification strategies, we present the first algorithms for fidelity-constrained entanglement distribution that are near-optimal and compatible with arbitrary purification models. Our approach introduces the notion of purification-augmented entanglement trees, and we develop dynamic programming (DP) algorithms to construct such trees that maximize the generation rate of entangled pairs (EPs) under fidelity constraints. We further extend our framework to a linear programming (LP)–based flow model that enables simultaneous generation of EPs across multiple source-destination pairs. For multipartite entanglement, we generalize our methods to GHZ and arbitrary graph states, supported by novel analytical models for fidelity evolution under fusion and purification. We evaluate our techniques using the NetSquid quantum network simulator and observe consistent performance improvements over prior approaches—achieving an average 50\% increase in generation rate, and up to 100-150\% in some scenarios.

•Sep 11, 2025•0 citations

Optimal Interpolation of Entanglement Purification Protocols

Matthew Barber, Stefano Pirandola

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.

quant-pharXiv:2511.09657•Physical Review A•Nov 14, 2025•3 citations
This work considers the problem of entanglement purification for the bit/phase flip channel model in quantum networks. The non-symmetric purification model is considered, where Bell pairs are distributed between adjacent node pairs with distinct fidelity values. Two purification methods are proposed for the non-symmetric purification model with the objective of maximizing the number of Bell pairs with fidelity value beyond the threshold fidelity. The properties of these methods are mathematically analyzed and supported by extensive simulation results. It is observed that the proposed methods have distinct properties and different applicability scenarios based on the input range of fidelity values and the fidelity threshold.
End-to-end entanglement distribution in multi-hop quantum networks experiences fidelity degradation as entanglement swapping progresses over noisy and heterogeneous channels. In this paper, we propose a virtual-link purification strategy in which multiple EPR pairs are used at each stage to create virtual links between non-adjacent nodes and then purified in cascade using symmetric purification. The approach allows parameterizing the number of links per stage and follows a hierarchical design, with a more complete first stage and simplified purification in subsequent stages. We implement a time-slot-based orchestrator and compare the proposal against conventional swapping under Werner and bit-flip noise models. The results indicate higher end-to-end fidelity with virtual-link purification.
We present a method to conduct both quantum state reconstruction and entanglement purification simultaneously that is advantageous in several respects over previous work in this direction, showing that the number of Bell pairs necessary to boot a quantum network can be significantly reduced compared to an existing method. The existing method requires at least 10510^5105 Bell pairs for the state reconstruction phase to estimate that the state is of fidelity 0.990.990.99 within the error range of 10−210^{-2}10−2, whereas our approach only requires around 2,8412,8412,841 to be certain with 99.7%99.7\%99.7% of confidence that the estimated fidelity lies within [0.99−0.01,0.99+0.01][0.99-0.01, 0.99+0.01][0.99−0.01,0.99+0.01]. In addition, in our approach we can start with a lower fidelity Bell pair and purify it multiple times, estimating at the same time the resultant fidelity with guarantee of 99.7%99.7\%99.7% that the fidelity estimate lies within a certain range. Moreover, the existing method cannot correct both bit-flip and phase-flip errors at the same time and can only correct one of these, whereas our approach can correct both bit-flip and phase-flip errors simultaneously. This research produces numerical estimates for the number of Bell pairs actually needed to guarantee a certain threshold fidelity FFF. The research can support the functioning real-world quantum networking by providing the information of the time needed for the bootstrapping of a quantum network to finish.
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.
The unbreakable security and higher data rates offered by quantum communication networks have made quantum communication an inevitable necessity of the future. Many quantum communication frameworks, such as quantum key distribution and super dense coding, require entangled pairs to be shared between the source and destination nodes. Communication nodes in quantum networks have a minimum fidelity requirement for the entangled pairs. If the fidelity requirement is not satisfied, the entangled pairs may not be used for the desired operations. Successful sharing of the entangled pairs between the nodes is a crucial step in making quantum communication practical. In this work, we propose a framework to maximize entanglement sharing between a source and multiple destination nodes in a fair manner. We consider a system that takes advantage of the purification process to improve the fidelity of the entangled pairs when necessary. The proposed solution framework provides the optimal number of entangled pairs required for the purification process and the optimal transmission rate at the source node to achieve the desired system objective. The non-convex problem is first transformed into a convex form, and then a Lagrangian dual-based framework is proposed to find the optimal solution values. Moreover, to optimize the number of entangled pairs for purification at each link, we derive a closed-form expression that provides the optimal value in a single step. Selected simulation results demonstrate that the proposed framework exhibits excellent performance.
Abstract We address the problem of efficiently distributing high-fidelity entangled states across the nodes of a quantum network—a fundamental requirement for quantum communication, distributed quantum computing, and emerging quantum internet applications. We consider a repeater-based architecture that combines entanglement swapping (or fusion) with purification operations, which enhance fidelity by consuming additional entangled pairs. While prior work has explored routing and limited purification strategies, we present the first algorithms for fidelity-constrained entanglement distribution that are near-optimal and compatible with arbitrary purification models. Our approach introduces the notion of purification-augmented entanglement trees, and we develop dynamic programming (DP) algorithms to construct such trees that maximize the generation rate of entangled pairs (EPs) under fidelity constraints. We further extend our framework to a linear programming (LP)–based flow model that enables simultaneous generation of EPs across multiple source-destination pairs. For multipartite entanglement, we generalize our methods to GHZ and arbitrary graph states, supported by novel analytical models for fidelity evolution under fusion and purification. We evaluate our techniques using the NetSquid quantum network simulator and observe consistent performance improvements over prior approaches—achieving an average 50\% increase in generation rate, and up to 100-150\% in some scenarios.
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.