pith. sign in

arxiv: 2605.08771 · v1 · submitted 2026-05-09 · 🪐 quant-ph

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

Anoosha Fayyaz , Prashant Krishnamurthy , Kaushik Seshadreesan , Amy Babay , David Tipper This is my paper

Pith reviewed 2026-05-12 02:06 UTC · model grok-4.3

classification 🪐 quant-ph
keywords entanglement purificationquantum repeater networksfidelity asymmetryquantum memory decoherenceentanglement swappingDeltaPurify policyquantum networks
0
0 comments X

The pith

Purification of entangled pairs is beneficial only when their fidelity asymmetry stays below a derived threshold

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that real quantum networks generate the two resource pairs for purification at different times, so one pair decoheres in memory and the fidelities differ. A closed-form tolerance function delta(F) tells exactly when purification still improves the swapped output fidelity. There is a hard universal cap near 0.076; above it, purification always lowers performance. Under exponential decoherence, the helpful cases are rare, occurring in roughly 14 percent of two-pair attempts on a two-hop chain. The authors introduce a conditional policy that checks the asymmetry locally before purifying, and show it shortens delivery time compared with always-purifying or never-purifying strategies.

Core claim

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. 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必要

What carries the argument

The closed-form fidelity asymmetry tolerance delta(F), a function of average fidelity that sets the maximum tolerable difference between the two input pairs for purification to raise the post-swap fidelity

Load-bearing premise

The model assumes the two resource pairs are generated sequentially with exponential memory decoherence and that fidelity after swapping and purification follows the standard bilinear formula without extra noise sources.

What would settle it

A simulation or experiment in which purification still improves end-to-end fidelity when the measured asymmetry exceeds 0.076 would falsify the universal upper bound.

Figures

Figures reproduced from arXiv: 2605.08771 by Amy Babay, Anoosha Fayyaz, David Tipper, Kaushik Seshadreesan, Prashant Krishnamurthy.

Figure 2
Figure 2. Figure 2: Fidelity decay under temporal decoherence and its consequence for [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The heatmap illustrates the net fidelity gain, defined as [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Distribution of fidelity gain ∆Fgain under three memory models. Under the CMM, purification is unconditionally beneficial. Under the LMM and EMM, the bulk of the distribution lies below zero, indicating that purification actively degrades the best available input in the majority of trials. The δ(F) criterion requires only local fidelity information and translates directly into Eq. 9. The operational conse￾… view at source ↗
Figure 5
Figure 5. Figure 5: Distribution of end-to-end entanglement delivery times for No [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 7
Figure 7. Figure 7: Entanglement delivery rates η ∈ [0, 1] as a function of fidelity threshold Fth (y-axis) and time budget N (x-axis) for No-Pur (left), SP (centre), and PS (right). those in which pairs spent longer in memory, and the resulting asymmetry drags the mean fidelity down as negative-gain cases come to dominate. Achieving high fidelity through SP therefore requires an application willing to accept a very low deliv… view at source ↗
Figure 8
Figure 8. Figure 8: Mean end-to-end delivery time as a function of hop count for No-Pur, [PITH_FULL_IMAGE:figures/full_fig_p008_8.png] view at source ↗
Figure 10
Figure 10. Figure 10: Entanglement delivery rate η ∈ [0, 1] as a function of Fth (y-axis) and N (x-axis) for No-Pur (left), SP (centre), and PS (right), for n = 3 hops. No-Pur maintains the widest feasible operating region across the joint parameter space. The relative ordering of policies is preserved compared to the 2-hop case ( [PITH_FULL_IMAGE:figures/full_fig_p008_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Distribution of time to serve for No-Pur, SP, and DeltaPurify across [PITH_FULL_IMAGE:figures/full_fig_p010_11.png] view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript derives a closed-form fidelity asymmetry tolerance δ(F) governing when purification is beneficial for two resource pairs in quantum repeater networks under exponential memory decoherence. It establishes a universal upper bound δ_max ≈ 0.076 beyond which purification is always counterproductive, reports that purification benefits only ~14% of attempts in a two-hop chain, and introduces the DeltaPurify policy that conditions purification decisions on local fidelity information. The work compares this policy against fidelity-only, time-only, and no-purification baselines across multiple fidelity thresholds and hop counts, showing reduced time-to-serve when purification is required to meet end-to-end fidelity targets.

Significance. If the closed-form derivations and simulation results hold, the paper supplies a practical, parameter-explicit criterion for purification decisions that addresses a structural feature of realistic networks. The explicit policy comparisons and reproducible simulation framework constitute a strength, offering concrete guidance for when to apply purification in multi-hop entanglement distribution.

minor comments (3)
  1. [§3] §3: The inequality F_purify(F, F-δ) > F_swap(F) is solved for δ(F); the manuscript should explicitly note the range of admissible F over which the closed-form expression is defined and any boundary conditions at F=1.
  2. [§5] §5: The reported 14% benefit fraction and policy performance metrics are simulation-based; the number of Monte Carlo trials and the precise value of the memory decoherence rate should be stated in the main text to allow direct reproduction.
  3. The bilinear fidelity update formula is invoked without derivation; a short appendix or reference to the standard purification map would improve accessibility for readers outside the immediate subfield.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive and accurate summary of the manuscript, including the closed-form derivation of the fidelity asymmetry tolerance, the universal bound of approximately 0.076, the observation that purification is beneficial in only ~14% of attempts, and the performance gains from the DeltaPurify policy. The recommendation for minor revision is noted. As the report contains no enumerated major comments, we provide no point-by-point rebuttals below.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The central derivation obtains delta(F) by solving the inequality F_purify(F, F-δ) > F_swap(F) using the standard bilinear fidelity map and exponential memory decoherence; the supremum delta_max follows directly from maximizing the resulting expression over admissible F. These update rules are externally standard and independent of the target tolerance, with no self-definitional reduction, fitted inputs renamed as predictions, or load-bearing self-citations. Simulations reproduce the 14% benefit fraction from the same explicit parameters without hidden assumptions, confirming the argument is self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard quantum fidelity update rules for purification and swapping plus an exponential decoherence model for memory; no new entities are postulated and no free parameters are explicitly fitted in the abstract.

axioms (2)
  • standard math Fidelity after purification and swapping follows the standard bilinear combination formula
    Invoked when deriving the tolerance delta(F) from input fidelities
  • domain assumption Memory decoherence follows an exponential decay law
    Used in the simulations that report the 14% benefit rate

pith-pipeline@v0.9.0 · 5618 in / 1349 out tokens · 44510 ms · 2026-05-12T02:06:37.084370+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages

  1. [1]

    Qubit teleportation between non-neighbouring nodes in a quantum network,

    S. Hermans, M. Pompili, H. Beukers, S. Baier, J. Borregaard, and R. Hanson, “Qubit teleportation between non-neighbouring nodes in a quantum network,”Nature, vol. 605, no. 7911, pp. 663–668, 2022

    work page 2022

  2. [2]

    Entanglement of nanophotonic quantum memory nodes in a telecom network,

    C. M. Knaut, A. Suleymanzade, Y .-C. Wei, D. R. Assumpcao, P.-J. Stas, Y . Q. Huan, B. Machielse, E. N. Knall, M. Sutula, G. Baranes,et al., “Entanglement of nanophotonic quantum memory nodes in a telecom network,”Nature, vol. 629, no. 8012, pp. 573–578, 2024

    work page 2024

  3. [3]

    EPB and Qubitekk launch com- mercial quantum network to accelerate development and adoption of quantum products

    EPB of Chattanooga and Qubitekk, “EPB and Qubitekk launch com- mercial quantum network to accelerate development and adoption of quantum products.” https://epb.com/newsroom/press-releases/epb-and-q ubitekk-launch-commercial-quantum-network-to-accelerate-developme nt-and-adoption-of-quantum-products/, November 2022. Press release. Accessed: February 2026

    work page 2022

  4. [4]

    High-rate scalable entanglement swapping between remote entanglement sources on deployed new york city fibers,

    A. N. Craddock, T. Cowan, N. Bigagli, S. Yekasiri, D. Robinson, G. B. Portmann, Z. Guo, M. Kilzer, J. Zhao, M. Flament,et al., “High-rate scalable entanglement swapping between remote entanglement sources on deployed new york city fibers,”arXiv preprint arXiv:2602.15653, 2026

    work page arXiv 2026

  5. [5]

    Purification of noisy entanglement and faithful teleportation via noisy channels,

    C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J. A. Smolin, and W. K. Wootters, “Purification of noisy entanglement and faithful teleportation via noisy channels,”Physical review letters, vol. 76, no. 5, p. 722, 1996

    work page 1996

  6. [6]

    Quantum privacy amplification and the security of quantum cryptography over noisy channels,

    D. Deutsch, A. Ekert, R. Jozsa, C. Macchiavello, S. Popescu, and A. Sanpera, “Quantum privacy amplification and the security of quantum cryptography over noisy channels,”Physical review letters, vol. 77, no. 13, p. 2818, 1996

    work page 1996

  7. [7]

    Quantum repeaters based on entanglement purification,

    W. Dür, H.-J. Briegel, J. I. Cirac, and P. Zoller, “Quantum repeaters based on entanglement purification,”Physical Review A, vol. 59, no. 1, p. 169, 1999

    work page 1999

  8. [8]

    High-fidelity entanglement routing in quantum networks,

    H. Hu, H. Lun, Z. Deng, J. Tang, J. Li, Y . Cao, Y . Wang, Y . Liu, D. Wu, H. Yu,et al., “High-fidelity entanglement routing in quantum networks,” Results in Physics, vol. 60, p. 107682, 2024

    work page 2024

  9. [9]

    Entanglement purification on quantum networks,

    M. Victora, S. Tserkis, S. Krastanov, A. S. de la Cerda, S. Willis, and P. Narang, “Entanglement purification on quantum networks,”Physical Review Research, vol. 5, no. 3, p. 033171, 2023

    work page 2023

  10. [10]

    An efficient scheduling scheme of swapping and purification operations for end-to-end entanglement distribution in quantum networks,

    Z. Wang, J. Li, K. Xue, D. S. Wei, R. Li, N. Yu, Q. Sun, and J. Lu, “An efficient scheduling scheme of swapping and purification operations for end-to-end entanglement distribution in quantum networks,”IEEE Transactions on Network Science and Engineering, vol. 11, no. 1, pp. 380–391, 2023

    work page 2023

  11. [11]

    From entanglement purification scheduling to fidelity-constrained multi-flow routing,

    Z. Jia and L. Chen, “From entanglement purification scheduling to fidelity-constrained multi-flow routing,”arXiv preprint arXiv:2408.08243, 2024

    work page arXiv 2024

  12. [12]

    Purification scheduling control for throughput maximization in quantum networks,

    Z. Xiao, J. Li, K. Xue, N. Yu, R. Li, Q. Sun, and J. Lu, “Purification scheduling control for throughput maximization in quantum networks,” Communications Physics, vol. 7, no. 1, p. 307, 2024

    work page 2024

  13. [13]

    Optimal fidelity-aware entanglement distribution in linear quantum networks,

    I. Koutsopoulos, “Optimal fidelity-aware entanglement distribution in linear quantum networks,” inMILCOM 2024-2024 IEEE Military Com- munications Conference (MILCOM), pp. 1124–1129, IEEE, 2024

    work page 2024

  14. [14]

    Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies,

    S. Haldar, P. J. Barge, X. Cheng, K.-C. Chang, B. T. Kirby, S. Khatri, C. W. Wong, and H. Lee, “Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies,”Communications Physics, vol. 8, no. 1, p. 132, 2025

    work page 2025

  15. [15]

    Exact rate anal- ysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible,

    L. Kamin, E. Shchukin, F. Schmidt, and P. Van Loock, “Exact rate anal- ysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible,”Physical Review Research, vol. 5, no. 2, p. 023086, 2023

    work page 2023

  16. [16]

    Parameter regimes for a single sequential quantum repeater,

    F. Rozp˛ edek, K. Goodenough, J. Ribeiro, N. Kalb, V . C. Vivoli, A. Reis- erer, R. Hanson, S. Wehner, and D. Elkouss, “Parameter regimes for a single sequential quantum repeater,”Quantum Science and Technology, vol. 3, no. 3, p. 034002, 2018

    work page 2018

  17. [17]

    En- tanglement purification in quantum networks: guaranteed improvement and optimal time,

    A. Zang, X.-A. Chen, E. Chitambar, M. Suchara, and T. Zhong, “En- tanglement purification in quantum networks: guaranteed improvement and optimal time,”arXiv preprint arXiv:2505.02286, 2025

    work page arXiv 2025

  18. [18]

    Efficient high-fidelity quantum computation using matter qubits and linear optics,

    S. D. Barrett and P. Kok, “Efficient high-fidelity quantum computation using matter qubits and linear optics,”Physical Review A—Atomic, Molecular, and Optical Physics, vol. 71, no. 6, p. 060310, 2005

    work page 2005

  19. [19]

    Enumerating all bilocal clifford distillation protocols through symmetry reduction,

    S. Jansen, K. Goodenough, S. de Bone, D. Gijswijt, and D. Elkouss, “Enumerating all bilocal clifford distillation protocols through symmetry reduction,”Quantum, vol. 6, p. 715, 2022

    work page 2022

  20. [20]

    On noise in swap asap repeater chains: exact analytics, distributions and tight approximations,

    K. Goodenough, T. Coopmans, and D. Towsley, “On noise in swap asap repeater chains: exact analytics, distributions and tight approximations,” Quantum, vol. 9, p. 1744, 2025

    work page 2025

  21. [21]

    Efficient computation of the waiting time and fidelity in quantum repeater chains,

    S. Brand, T. Coopmans, and D. Elkouss, “Efficient computation of the waiting time and fidelity in quantum repeater chains,”IEEE Journal on Selected Areas in Communications, vol. 38, no. 3, pp. 619–639, 2020

    work page 2020

  22. [22]

    On the analysis of quantum repeater chains with sequential swaps,

    M. G. de Andrade, E. A. Van Milligen, L. Bacciottini, A. Chandra, S. Pouryousef, N. K. Panigrahy, G. Vardoyan, and D. Towsley, “On the analysis of quantum repeater chains with sequential swaps,”arXiv preprint arXiv:2405.18252, 2024

    work page arXiv 2024

  23. [23]

    On selecting paths for end-to-end entanglement creation in quantum networks,

    A. Fayyaz, P. Krishnamurthy, K. P. Seshadreesan, D. Tipper, and A. Babay, “On selecting paths for end-to-end entanglement creation in quantum networks,” in2025 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 1, pp. 1225–1236, IEEE, 2025

    work page 2025