pith. sign in

arxiv: 2605.05369 · v1 · submitted 2026-05-06 · 🪐 quant-ph

Toward Hop-Independent Fidelity in Quantum Data Centers: Resource Requirements for Entanglement Purification

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

Pith reviewed 2026-05-08 16:29 UTC · model grok-4.3

classification 🪐 quant-ph
keywords entanglement purificationWerner statesquantum networksBBPSSW protocolquantum data centersfidelity restorationmulti-hop entanglement
0
0 comments X

The pith

Jansen-family purification protocols require fewer copies than BBPSSW at over 96 percent of feasible points to restore target fidelity after multi-hop distribution.

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

Quantum data centers need end-to-end entanglement whose quality does not degrade with path length, yet each swapping step lowers the Werner parameter of the shared state. The paper models the network as a black-box collection of independent Werner states and computes exact success probabilities for an all-in recursive purification schedule via dynamic programming. It compares standard BBPSSW recursion against the higher-order bilocal-Clifford protocols of Jansen et al. and shows that the latter family succeeds with markedly lower copy budgets while both protocols exhibit a sharp viability threshold set by the condition w0^ℓ greater than 1/3. These resource landscapes supply a quantitative benchmark for deciding whether future quantum data-center architectures can support hop-independent fidelity.

Core claim

Across the evaluated grid the Jansen family requires fewer copies than BBPSSW at more than 96 percent of shared feasible points; at p_th equal to 0.70 the median copy budget drops from 268 to 30. Both families display a threshold structure governed by the Werner entanglement condition w0^ℓ greater than 1/3, and multi-copy purification improves both feasibility and copy efficiency for restoring the original link quality.

What carries the argument

The topology-independent black-box model in which every elementary link is an independent Werner state with parameter w0 and ideal swapping produces equal-quality copies with parameter w0^ℓ, together with exact dynamic-programming evaluation of all-in recursive purification success probabilities.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The relative advantage of Jansen protocols would likely survive the inclusion of modest memory decoherence, though absolute budgets would rise.
  • These benchmarks can be used to size the multiplexing and connection-retry resources needed for a given network diameter.
  • Extending the model to non-ideal swaps would give tighter guidance for near-term hardware implementations.

Load-bearing premise

Every elementary link produces an independent Werner state and every swap is ideal, with no memory decoherence or topology-dependent noise.

What would settle it

A laboratory measurement of the number of raw copies actually required to reach a target Werner parameter after multi-hop distribution using both BBPSSW and Jansen protocols would confirm or refute the predicted copy reductions.

Figures

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

Figure 1
Figure 1. Figure 1: Schematic of the black-box setting studied in this work. First, view at source ↗
Figure 2
Figure 2. Figure 2: Condensed comparison of the minimum raw-copy budget view at source ↗
Figure 3
Figure 3. Figure 3: Black-box resource landscape for hop-independent Werner recovery. Each panel is a heatmap over path length view at source ↗
Figure 4
Figure 4. Figure 4: Optimal recursion depth k associated with the minimum-copy solutions in view at source ↗
read the original abstract

Quantum data-center networks must distribute entanglement between QPUs over paths whose length grows with system scale, but each entanglement-swapping step reduces the quality of the raw end-to-end state. Topology, multiplexing, and repeated connection attempts can increase the number of raw end-to-end copies available for a request, yet they do not answer the central resource question: whether those copies are sufficient to remove, via entanglement purification, the fidelity loss caused by multi-hop distribution. We study this question through a topology-independent black-box model of the network. Each elementary link is modeled as a Werner state with parameter $w_0$, so ideal swapping over an $\ell$-link path produces equal-quality raw copies with Werner parameter $w_0^\ell$; purification succeeds if it outputs at least one state with Werner parameter at least $w_0$ with probability at least $p_{\mathrm{th}}$. We compare recursive BBPSSW purification with higher-order $r$-to-$1$ bilocal-Clifford purification protocols of Jansen \emph{et al.}, using an all-in recursive schedule whose success probability is computed by exact dynamic programming. The resulting resource landscapes show a threshold structure governed by the Werner entanglement condition $w_0^\ell>1/3$ and demonstrate that multi-copy purification substantially improves both feasibility and copy efficiency. Across the evaluated grid, the Jansen family requires fewer copies than BBPSSW at more than $96\%$ of shared feasible points; at $p_{\mathrm{th}}=0.70$, the median copy budget drops from $268$ to $30$. These results provide a quantitative purification-resource benchmark for assessing whether future quantum data-center architectures can practically support hop-independent end-to-end entanglement quality.

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 paper introduces a topology-independent black-box model for assessing entanglement purification resources in quantum data-center networks. Elementary links are Werner states with parameter w0; ideal swapping over an ℓ-hop path yields raw copies with parameter w0^ℓ. Purification is deemed successful if it produces at least one output state with Werner parameter ≥ w0 with probability ≥ p_th. Using an all-in recursive schedule whose success probability is computed exactly via dynamic programming, the authors compare standard BBPSSW purification against higher-order r-to-1 bilocal-Clifford protocols from the Jansen family. Within the evaluated parameter grid the Jansen protocols require fewer copies than BBPSSW at >96 % of shared feasible points, with the median copy budget at p_th=0.70 dropping from 268 to 30. All statistics are restricted to the stated Werner-state model with ideal swapping.

Significance. If the numerical results hold, the work supplies a concrete, reproducible resource benchmark for the purification overhead needed to restore hop-independent end-to-end fidelity. The explicit scoping of the model (Werner states, ideal swapping, exact DP) and the direct comparison of copy budgets constitute a useful quantitative reference for quantum-network architecture studies. The exact dynamic-programming approach and the clear separation between model assumptions and reported statistics are particular strengths.

minor comments (3)
  1. The abstract states that success probabilities are obtained by 'exact dynamic programming,' yet the manuscript should include the recurrence relations or pseudocode (likely in the Methods or §3) together with a brief numerical-stability check for the largest copy budgets considered.
  2. Figure captions and axis labels should explicitly restate the success criterion (Werner parameter ≥ w0 with probability ≥ p_th) so that readers can interpret the resource landscapes without returning to the text.
  3. A short table or paragraph listing the precise ranges and sampling of w0, ℓ, and p_th used in the grid would improve reproducibility.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our work, the recognition of its strengths in providing a reproducible resource benchmark, and the recommendation for minor revision. No specific major comments or requested changes were provided in the report.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper defines an explicit black-box model (Werner states w0, ideal swapping to w0^ℓ) and computes all reported resource counts and feasibility statistics via exact dynamic programming over the all-in recursive success probabilities of the purification protocols. No parameters are fitted to data, no predictions are renamed fitted inputs, and no load-bearing step reduces by construction to a self-citation or self-definition; the central numerical comparison (Jansen vs. BBPSSW copy budgets) is a direct output of the model equations and DP procedure within the stated assumptions.

Axiom & Free-Parameter Ledger

2 free parameters · 3 axioms · 0 invented entities

The central claim rests on standard quantum-information assumptions about Werner states and purification protocols drawn from prior literature (BBPSSW and Jansen et al.). No new physical entities are postulated. The free parameters are simply the model inputs that are swept over a grid.

free parameters (2)
  • w0
    Werner parameter of each elementary link; swept across a grid of values
  • p_th
    Minimum success probability required for a purification output to count as usable
axioms (3)
  • domain assumption Each elementary link is a Werner state with parameter w0
    Standard model for depolarized entanglement in quantum networks
  • domain assumption Ideal entanglement swapping over an ℓ-link path yields copies with Werner parameter w0^ℓ
    Well-known algebraic property of Werner states under swapping
  • domain assumption Purification succeeds when it outputs at least one state with Werner parameter ≥ w0 with probability ≥ p_th
    Operational definition chosen for the resource-requirement study

pith-pipeline@v0.9.0 · 5643 in / 1741 out tokens · 41158 ms · 2026-05-08T16:29:19.174711+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages

  1. [1]

    Distributed quantum computation over noisy channels,

    J. I. Cirac, A. K. Ekert, S. F. Huelga, and C. Macchiavello, “Distributed quantum computation over noisy channels,”Physical Review A, vol. 59, no. 6, pp. 4249–4254, 1999

    work page 1999

  2. [2]

    Distributed quantum computing: A survey,

    M. Caleffi, M. Amoretti, D. Ferrari, J. Illiano, A. Manzalini, and A. S. Cacciapuoti, “Distributed quantum computing: A survey,”Computer Networks, vol. 254, p. 110672, 2024

    work page 2024

  3. [3]

    Quantum data center infrastructures: A scalable architectural design perspective,

    H. Shapourian, E. Kaur, T. Sewell, J. Zhao, M. Kilzer, R. Kompella, and R. Nejabati, “Quantum data center infrastructures: A scalable architectural design perspective,” 2025

    work page 2025

  4. [4]

    Quantum data centres: Why entanglement changes everything,

    A. S. Cacciapuoti, C. Pellitteri, J. Illiano, L. d’Avossa, F. Mazza, S. Chen, and M. Caleffi, “Quantum data centres: Why entanglement changes everything,” 2025

    work page 2025

  5. [5]

    Benchmarking quantum data center architectures: A performance and scalability perspective,

    S. Pouryousef, E. Kaur, H. Shapourian, D. Towsley, R. Kompella, and R. Nejabati, “Benchmarking quantum data center architectures: A performance and scalability perspective,” 2026

    work page 2026

  6. [6]

    “Event- ready-detectors

    M. Zukowski, A. Zeilinger, M. A. Horne, and A. K. Ekert, ““Event- ready-detectors” Bell experiment via entanglement swapping,”Physical Review Letters, vol. 71, no. 26, pp. 4287–4290, 1993

    work page 1993

  7. [7]

    Quantum repeaters: The role of imperfect local operations in quantum communication,

    H.-J. Briegel, W. D ¨ur, J. I. Cirac, and P. Zoller, “Quantum repeaters: The role of imperfect local operations in quantum communication,”Physical Review Letters, vol. 81, no. 26, pp. 5932–5935, 1998

    work page 1998

  8. [8]

    Quantum repeaters based on entanglement purification,

    W. D ¨ur, H.-J. Briegel, J. I. Cirac, and P. Zoller, “Quantum repeaters based on entanglement purification,”Physical Review A, vol. 59, no. 1, pp. 169–181, 1999

    work page 1999

  9. [9]

    Distribution of entanglement in large-scale quantum networks,

    S. Perseguers, J. Gerald J. Lapeyre, D. Cavalcanti, M. Lewenstein, and A. Ac ´ın, “Distribution of entanglement in large-scale quantum networks,”Reports on Progress in Physics, vol. 76, no. 9, p. 096001, 2013

    work page 2013

  10. [10]

    End-to-end capacities of a quantum communication network,

    S. Pirandola, “End-to-end capacities of a quantum communication network,”Communications Physics, vol. 2, p. 51, 2019

    work page 2019

  11. [11]

    Routing entanglement in the quantum internet,

    M. Pant, H. Krovi, D. Towsley, L. Tassiulas, L. Jiang, P. Basu, D. En- glund, and S. Guha, “Routing entanglement in the quantum internet,” npj Quantum Information, vol. 5, no. 1, p. 25, 2019

    work page 2019

  12. [12]

    Entanglement generation in a quantum network at distance-independent rate,

    A. Patil, M. Pant, D. Englund, D. Towsley, and S. Guha, “Entanglement generation in a quantum network at distance-independent rate,”npj Quantum Information, vol. 8, p. 51, 2022

    work page 2022

  13. [13]

    Distribution of entanglement in two-dimensional square grid network,

    E. Kaur and S. Guha, “Distribution of entanglement in two-dimensional square grid network,” in2023 IEEE International Conference on Quan- tum Computing and Engineering (QCE), 2023, pp. 1154–1164

    work page 2023

  14. [14]

    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, pp. 722–725, 1996

    work page 1996

  15. [15]

    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, pp. 2818–2821, 1996

    work page 1996

  16. [16]

    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

  17. [17]

    Optimistic entan- glement purification in quantum networks,

    M. Mobayenjarihani, G. Vardoyan, and D. Towsley, “Optimistic entan- glement purification in quantum networks,” 2024

    work page 2024

  18. [18]

    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

  19. [19]

    Near-term n to k distillation protocols using graph codes,

    K. Goodenough, S. de Bone, V . L. Addala, S. Krastanov, S. Jansen, D. Gijswijt, and D. Elkouss, “Near-term n to k distillation protocols using graph codes,”IEEE Journal on Selected Areas in Communications, vol. 42, no. 7, pp. 1830–1849, 2024

    work page 2024

  20. [20]

    Code for hop-independent fidelity resource analysis,

    M. Azari and A. Fayyaz, “Code for hop-independent fidelity resource analysis,” https://github.com/mohadesehazari98/Percolation Collaboration, 2026, accessed: 2026-04-27

    work page 2026

  21. [21]

    Bcube: A high performance, server-centric network architecture for modular data centers,

    C. Guo, G. Lu, D. Li, H. Wu, X. Zhang, Y . Shi, C. Tian, Y . Zhang, and S. Lu, “Bcube: A high performance, server-centric network architecture for modular data centers,” inProceedings of the ACM SIGCOMM 2009 Conference on Data Communication, 2009, pp. 63–74

    work page 2009

  22. [22]

    Topology-aware resource analysis for hop-independent fidelity in quantum data-center networks,

    M. Azariet al., “Topology-aware resource analysis for hop-independent fidelity in quantum data-center networks,” 2026, in preparation

    work page 2026

  23. [23]

    Distance-independent entanglement generation in a quantum network using space-time multiplexed greenberger–horne–zeilinger (ghz) mea- surements,

    A. Patil, E. S. Jacobson, E. Van Milligen, D. Towsley, and S. Guha, “Distance-independent entanglement generation in a quantum network using space-time multiplexed greenberger–horne–zeilinger (ghz) mea- surements,” in2021 IEEE International Conference on Quantum Com- puting and Engineering (QCE), 2021, pp. 334–345

    work page 2021