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

TL;DR

This paper analyzes when entanglement purification is beneficial in quantum networks with asymmetric input fidelities, deriving conditions and proposing policies to optimize fidelity and time performance.

Contribution

It introduces a fidelity asymmetry tolerance and a policy, DeltaPurify, that improves purification decisions based on local fidelity information in quantum repeater networks.

Findings

Purification is beneficial only if fidelity asymmetry is below approximately 0.076.

In simulations, purification improves success in about 14% of attempts with exponential memory decoherence.

DeltaPurify reduces time-to-serve compared to naive and no-purification policies across various scenarios.

Abstract

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.