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

• URL: http://arxiv.org/abs/2605.08771v1
• Date: Sat, 09 May 2026 07:58:03 GMT
• Title: To Purify or Not to Purify: Entanglement Purification under Input Fidelity Asymmetry in Quantum Networks
• Abstract summary: Entanglement purification with two entangled resource pairs is widely employed in the literature on quantum repeater networks.<n>We show that 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.<n>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.
• Score: 1.5114999589746663
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Survive or Collapse: The Asymmetric Roles of Data Gating and Reward Grounding in Self-Play RL [76.45061154544568]
  Self-play reinforcement learning trains language models on their own generated tasks, co-evolving a proposer and solver without human labels.<n>Recent systems report strong reasoning gains, but collapse and instability are widely observed and poorly understood.<n>We argue instead that self-play stability is governed by two distinct levers: a data-level gate that decides which proposer-generated tasks enter the training pool, and the reward signal that updates the policy on tasks already admitted.
  arXiv  Detail & Related papers  (2026-05-21T09:19:23Z)
• The Choice of Divergence: A Neglected Key to Mitigating Diversity Collapse in Reinforcement Learning with Verifiable Reward [57.56453588632619]
  A central paradox in fine-tuning Large Language Models (LLMs) with Reinforcement Learning with Verifiable Reward (RLVR) is the frequent degradation of multi-attempt performance.<n>This is often accompanied by catastrophic forgetting, where models lose previously acquired skills.<n>We argue that standard RLVR objectives lack a crucial mechanism for knowledge retention.
  arXiv  Detail & Related papers  (2025-09-09T06:34:32Z)
• Optimal Fidelity-Aware Entanglement Distribution in Linear Quantum Networks [5.136852624384612]
  We study the problem of maximizing a utility function that captures the total fidelity of end-to-end entanglements in a two-link linear quantum network. We propose two algorithms, the Purify-then-Swap (PtS) and Swap-then-Purify (StP) ones, where the decisions about purification and swapping are taken with different order.
  arXiv  Detail & Related papers  (2024-07-12T11:09:30Z)
• Optimistic Entanglement Purification in Quantum Networks [11.511763058777259]
  Noise and photon loss encountered on quantum channels pose a major challenge for reliable entanglement generation in quantum networks. In near-term networks, heralding is required to inform endpoints of successfully generated entanglement. We apply optimism to the entanglement pumping scheme, ground- and satellite-based EPR generation sources, and current state-of-the-art purification circuits.
  arXiv  Detail & Related papers  (2024-01-16T01:08:17Z)
• Entanglement buffering with two quantum memories [0.0]
  Quantum networks crucially rely on the availability of high-quality entangled pairs of qubits, known as entangled links. Maintaining the quality of these links is a challenging task due to the presence of time-dependent noise. Entanglement purification protocols offer a solution by converting multiple low-quality entangled states into a smaller number of higher-quality ones.
  arXiv  Detail & Related papers  (2023-11-16T17:46:00Z)
• On the Fidelity Distribution of Link-level Entanglements under Purification [3.5957268592786966]
  Link-level Einstein-Podolsky-Rosen (EPR) pairs may be continuously generated and stored in a few quantum memories. A major challenge is that qubits suffer from unavoidable noise due to their interaction with the environment. We show the probability distribution of the fidelity of stored link-level EPR pairs in a system with two quantum memories at each node.
  arXiv  Detail & Related papers  (2023-10-27T15:16:19Z)
• Quantum control landscape for generation of $H$ and $T$ gates in an open qubit with both coherent and environmental drive [57.70351255180495]
  An important problem in quantum computation is generation of single-qubit quantum gates such as Hadamard ($H$) and $pi/8$ ($T$) Here we consider the problem of optimal generation of $H$ and $T$ gates using coherent control and the environment as a resource acting on the qubit via incoherent control.
  arXiv  Detail & Related papers  (2023-09-05T09:05:27Z)
• Repeated Purification versus Concatenated Error Correction in Fault Tolerant Quantum Networks [3.52359746858894]
  Successful entanglement swapping is error-prone. The occurrence of quantum errors can be using purification and error correction. We compare the two options: repeated purification and iterationsd error correction.
  arXiv  Detail & Related papers  (2023-02-27T14:10:35Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• On the Practicality of Differential Privacy in Federated Learning by Tuning Iteration Times [51.61278695776151]
  Federated Learning (FL) is well known for its privacy protection when training machine learning models among distributed clients collaboratively. Recent studies have pointed out that the naive FL is susceptible to gradient leakage attacks. Differential Privacy (DP) emerges as a promising countermeasure to defend against gradient leakage attacks.
  arXiv  Detail & Related papers  (2021-01-11T19:43:12Z)
• A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
  We propose a weaker assumption that we call $2$-adjacency faithfulness. We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
  arXiv  Detail & Related papers  (2020-10-27T13:04:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.