pith. sign in

arxiv: 2606.07043 · v1 · pith:JVXXVP2Unew · submitted 2026-06-05 · 🪐 quant-ph

Exact noise characterization of entanglement distribution in star networks

Kenneth Goodenough , Xiaonan Chen , Patrick Emonts This is my paper

Pith reviewed 2026-06-27 21:48 UTC · model grok-4.3

classification 🪐 quant-ph
keywords GHZ statesstar networksentanglement distributionmemory dephasingquantum networksnoise distributionanalytical expressionscut-off optimization
0
0 comments X

The pith

Analytical expressions quantify the average noise and its distribution for GHZ state distribution under dephasing in star networks.

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

Multipartite entanglement is essential for many quantum networking tasks, and star topologies are expected to be used first for its distribution. In star networks, links succeed stochastically and must be stored in memory, incurring decoherence that depends on random waiting times. The paper derives closed analytical expressions for both the mean noise and the complete noise distribution when creating GHZ states subject to memory dephasing. It examines the factory and piecemaker protocols and includes a global cut-off case plus an extension to depolarizing noise. Knowing the exact noise statistics makes it possible to predict and optimize network performance without running extensive simulations.

Core claim

In star networks for multipartite entanglement distribution, elementary links are generated at random times and stored until all succeed. This leads to waiting-time-dependent dephasing noise on the stored links. We obtain exact analytical formulas for the resulting average noise and the full distribution of that noise for GHZ states. The formulas apply to both the factory and piecemaker protocols and cover global cut-off times as well as depolarizing noise in the factory case.

What carries the argument

The distribution of random waiting times for elementary link successes, which sets the amount of dephasing applied to each stored link.

If this is right

  • A global cut-off time can be optimized rapidly using the closed-form expressions without Monte Carlo simulations.
  • The factory and piecemaker protocols can be compared directly on their exact noise performance.
  • The factory protocol analysis extends to depolarizing noise for arbitrary input states.
  • The derived noise distribution gives the precise fidelity achievable for distributed GHZ states.

Where Pith is reading between the lines

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

  • The same waiting-time approach could be applied to other network shapes once their success-time statistics are known.
  • Exact expressions reduce reliance on numerical sampling when planning memory lifetimes or cut-off policies.
  • The framework suggests that memory dephasing during waits is the dominant, fully characterizable noise source in near-term star networks.

Load-bearing premise

Decoherence arises solely from dephasing during the random waiting times that successful links spend in memory.

What would settle it

Measuring the actual distribution of output noise in a physical star network realizing GHZ distribution and checking whether it matches the analytical distribution obtained by integrating over the exponential waiting-time law under the dephasing channel.

Figures

Figures reproduced from arXiv: 2606.07043 by Kenneth Goodenough, Patrick Emonts, Xiaonan Chen.

Figure 1
Figure 1. Figure 1: FIG. 1: Fidelity as a function of the number of end [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2: Conference-key agreement rate as a function of [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4: Distribution of the fidelity for the factory and [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5: Conference-key agreement rate with the factory [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6: Comparison of the factory and piecemaker protocols for [PITH_FULL_IMAGE:figures/full_fig_p014_6.png] view at source ↗
read the original abstract

Multipartite entanglement forms the core of many networking applications. In the near-term future, it is expected that multipartite distribution will be achieved first through star topologies, making it important to understand the noise incurred during the distribution process. In such networks, elementary links are created stochastically and successful links must be stored while waiting for the remaining links, causing memory decoherence that depends on the random waiting times. We derive analytical expressions for both the average noise and its distribution, when distributing GHZ states under memory dephasing in star networks. We study and compare two distribution protocols: the factory and piecemaker protocol. Furthermore, we find expressions for the case of a global cut-off (allowing fast optimization of the cut-off without requiring Monte Carlo simulations) and extend the analysis for the factory protocol to depolarizing noise for arbitrary states.

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 / 1 minor

Summary. The manuscript derives analytical (closed-form) expressions for both the average noise and the full noise distribution incurred when distributing GHZ states under memory dephasing in star networks. It compares the factory and piecemaker protocols, supplies expressions for a global cut-off time, and extends the factory-protocol analysis to depolarizing noise acting on arbitrary states.

Significance. If the derivations hold, the closed-form results eliminate the need for Monte Carlo sampling when optimizing cut-off times and supply exact characterizations of noise statistics; this is a concrete advance for modeling multipartite entanglement distribution in near-term quantum networks.

minor comments (1)
  1. [Abstract] The abstract states that derivations exist but supplies no equations, key assumptions, or verification steps; while the full text presumably contains them, a brief inline reference to the central result (e.g., the form of the waiting-time distribution or the dephasing map) would improve readability for readers who stop at the abstract.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of our manuscript and for recommending acceptance. No major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper derives closed-form analytical expressions for average noise and its distribution under memory dephasing for GHZ distribution in star networks. No equations, fitting procedures, or self-citation chains are visible in the provided abstract or description that reduce any claimed prediction or result to its inputs by construction. The modeling assumptions (storage during random waiting times under dephasing) are standard and externally falsifiable, leaving the derivation self-contained against benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no free parameters, axioms, or invented entities can be identified.

pith-pipeline@v0.9.1-grok · 5667 in / 899 out tokens · 20440 ms · 2026-06-27T21:48:25.975068+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

40 extracted references · 6 linked inside Pith

  1. [1]

    Murta, F

    G. Murta, F. Grasselli, H. Kampermann, and D. Bruß, Quantum conference key agreement: A review, Advanced Quantum Technologies3, 2000025 (2020)

    2020

  2. [2]

    Markham and B

    D. Markham and B. C. Sanders, Graph states for quan- tum secret sharing, Physical Review A—Atomic, Molec- ular, and Optical Physics78, 042309 (2008)

    2008

  3. [3]

    Gravier, J

    S. Gravier, J. Javelle, M. Mhalla, and S. Perdrix, Quan- tum secret sharing with graph states, inInternational Doctoral Workshop on Mathematical and Engineering Methods in Computer Science(Springer, 2012) pp. 15– 31

    2012

  4. [4]

    Zhang and Q

    Z. Zhang and Q. Zhuang, Distributed quantum sensing, Quantum Science and Technology6, 043001 (2021)

    2021

  5. [5]

    X. Kong, T. Xin, S.-J. Wei, B. Wang, Y. Wang, K. Li, and G.-L. Long, Demonstration of multiparty quantum clock synchronization., Quantum Information Processing 17(2018)

    2018

  6. [6]

    Lamas-Linares and J

    A. Lamas-Linares and J. Troupe, Secure quantum clock synchronization, inAdvances in Photonics of Quantum Computing, Memory, and Communication XI,Vol.10547 (SPIE, 2018) pp. 59–66. 7

    2018

  7. [7]

    Goodenough, T

    K. Goodenough, T. Coopmans, and D. Towsley, On noise in swap ASAP repeater chains: Exact analytics, distribu- tions and tight approximations (2024), arXiv:2404.07146 [quant-ph]

    arXiv 2024

  8. [9]

    B. Li, T. Coopmans, and D. Elkouss, Efficient optimiza- tion of cutoffs in quantum repeater chains, IEEE Trans- actions on Quantum Engineering2, 1 (2021)

    2021

  9. [10]

    Kamin, E

    L. Kamin, E. Shchukin, F. Schmidt, and P. van Loock, Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possi- ble, Physical Review Research5, 023086 (2023)

    2023

  10. [11]

    Chehimi, K

    M. Chehimi, K. Goodenough, W. Saad, D. Towsley, and T. X. Zhou, Entanglement distribution delay optimiza- tion in quantum networks with distillation, IEEE Journal on Selected Areas in Communications (2025)

    2025

  11. [12]

    G. Avis, F. Rozpędek, and S. Wehner, Analysis of multipartite entanglement distribution using a central quantum-network node, Physical Review A107, 012609 (2023)

    2023

  12. [13]

    Prielinger, K

    L. Prielinger, K. Goodenough, G. Avis, S. Kras- tanov, D. Towsley, and G. Vardoyan, Piecemaker: a resource-efficient entanglement distribution protocol, arXiv preprint arXiv:2508.14737 (2025)

    Pith/arXiv arXiv 2025

  13. [14]

    A.Sen, K.Goodenough,andD.Towsley,Multipartiteen- tanglement distribution in quantum networks using sub- graph complementations, Quantum9, 1911 (2025)

    1911

  14. [15]

    Cuquet and J

    M. Cuquet and J. Calsamiglia, Growth of graph states in quantum networks, Physical Review A—Atomic, Molec- ular, and Optical Physics86, 042304 (2012)

    2012

  15. [16]

    Goodenough and P

    K. Goodenough and P. Emonts, Optimization of quan- tum networks using tensor networks (2026), in prepara- tion

    2026

  16. [17]

    Memmen, J

    J. Memmen, J. Kunzelmann, N. Walk, J. Eisert, and J. Wallnöfer, Strategy optimization for quantum confer- ence key agreement in asymmetric star networks, arXiv preprint arXiv::2605.18677 (2026)

    Pith/arXiv arXiv 2026

  17. [18]

    Github repository: Patrickemonts/repeater-network- analytics,https://github.com/patrickemonts/ repeater-network-analytics

  18. [19]

    Rozpędek, K

    F. Rozpędek, K. Goodenough, J. Ribeiro, N. Kalb, V. C. Vivoli, A. Reiserer, R. Hanson, S. Wehner, and D. Elk- ouss, Parameter regimes for a single sequential quantum repeater, Quantum Science and Technology3, 034002 (2018)

    2018

  19. [20]

    Rozpędek, R

    F. Rozpędek, R. Yehia, K. Goodenough, M. Ruf, P. C. Humphreys, R. Hanson, S. Wehner, and D. Elkouss, Near-term quantum-repeater experiments with nitrogen- vacancy centers: Overcoming the limitations of direct transmission, Physical Review A99, 052330 (2019)

    2019

  20. [21]

    Azuma, S

    K. Azuma, S. Bäuml, T. Coopmans, D. Elkouss, and B. Li, Tools for quantum network design, AVS Quantum Science3, 014101 (2021)

    2021

  21. [22]

    Praxmeyer, Reposition time in probabilistic imperfect memories (2013), arXiv:1309.3407 [quant-ph]

    L. Praxmeyer, Reposition time in probabilistic imperfect memories (2013), arXiv:1309.3407 [quant-ph]

    Pith/arXiv arXiv 2013

  22. [23]

    Shchukin, F

    E. Shchukin, F. Schmidt, and P. van Loock, Waiting time in quantum repeaters with probabilistic entangle- ment swapping, Physical Review A100, 032322 (2019)

    2019

  23. [24]

    Epping, H

    M. Epping, H. Kampermann, D. Bruß,et al., Multi- partite entanglement can speed up quantum key distri- bution in networks, New Journal of Physics19, 093012 (2017)

    2017

  24. [25]

    Avis and S

    G. Avis and S. Krastanov, Optimization of quantum- repeater networks using stochastic automatic differentia- tion, Physical Review Research7, 033111 (2025)

    2025

  25. [26]

    B. Li, T. Coopmans, and D. Elkouss, Efficient Opti- mization of Cutoffs in Quantum Repeater Chains, IEEE Transactions on Quantum Engineering2, 1 (2021)

    2021

  26. [27]

    Y. Jing, D. Alsina, and M. Razavi, Quantum key dis- tribution over quantum repeaters with encoding: Using error detection as an effective postselection tool, Physical Review Applied14, 064037 (2020)

    2020

  27. [28]

    Goodenough, S

    K. Goodenough, S. De Bone, V. 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 Communications42, 1830 (2024)

    2024

  28. [29]

    J. A. Kunzelmann, A. Trushechkin, N. Wyderka, H. Kampermann, and D. Bruß, Multiplexed multipartite quantum repeater rates in the stationary regime, arXiv preprint arXiv:2505.18031 (2025)

    arXiv 2025

  29. [30]

    R. P. Stanley, Enumerative combinatorics volume 1 sec- ond edition, Cambridge studies in advanced mathematics (2011)

    2011

  30. [31]

    Wyderka and O

    N. Wyderka and O. Gühne, Characterizing quantum states via sector lengths, Journal of Physics A: Math- ematical and Theoretical53, 345302 (2020)

    2020

  31. [32]

    Miller, D

    D. Miller, D. Loss, I. Tavernelli, H. Kampermann, D. Bruß, and N. Wyderka, Shor–laflamme distributions of graph states and noise robustness of entanglement, Journal of Physics A: Mathematical and Theoretical56, 335303 (2023)

    2023

  32. [33]

    Vallée, K

    E. Vallée, K. Goodenough, P. E. Gunnells, T. Coopmans, and J. Tura, Sector length distributions of recursively definable graph states through analytic combinatorics, arXiv preprint arXiv:2604.09766 (2026)

    Pith/arXiv arXiv 2026

  33. [34]

    E. M. Rains, Quantum weight enumerators, IEEE Trans- actions on Information Theory44, 1388 (2002)

    2002

  34. [35]

    E. M. Rains, Quantum shadow enumerators, IEEE trans- actions on information theory45, 2361 (1999)

    1999

  35. [36]

    Miller, K

    D. Miller, K. Levi, L. Postler, A. Steiner, L. Bittel, G. A. White, Y. Tang, E. J. Kuehnke, A. A. Mele, S. Kha- tri,et al., Experimental measurement and a physical interpretation of quantum shadow enumerators, arXiv preprint arXiv:2408.16914 (2024)

    Pith/arXiv arXiv 2024

  36. [37]

    Miller and J

    D. Miller and J. Eisert, Detecting entanglement from few partial transpose moments and their decay via weight enumerators, arXiv preprint arXiv:2604.12576 (2026)

    Pith/arXiv arXiv 2026

  37. [38]

    N. K. Bernardes, L. Praxmeyer, and P. van Loock, Rate analysis for a hybrid quantum repeater, Physical Review A83, 012323 (2011). 8 Appendix A: Factory protocol

    2011

  38. [39]

    As before, letnbe the number of end users in such a network, andλ, qbe the (homogeneous) parameters describing the decoherence and the failure probability, respectively

    Derivation for the factory protocol under dephasing We prove here a closed-form expression of the average noise in the factory protocol, in the case of dephasing. As before, letnbe the number of end users in such a network, andλ, qbe the (homogeneous) parameters describing the decoherence and the failure probability, respectively. A possible instance of t...

  39. [40]

    We use the fact that anyn-qubit state can be expanded in the Pauli basis, ρ= 1 2n X P Tr(P ρ)·P,(A5) where thePare all4 n (phaseless) Pauli strings of lengthn

    Depolarizing noise for the factory protocol for arbitrary states We now extend the analysis from the previous subsection to uniform depolarizing on arbitrary states. We use the fact that anyn-qubit state can be expanded in the Pauli basis, ρ= 1 2n X P Tr(P ρ)·P,(A5) where thePare all4 n (phaseless) Pauli strings of lengthn. Since quantum channels are line...

  40. [41]

    Herew(P)is the weight ofP, i.e

    Extending to then-qubit case, we find that for uniform depolarizing noise Pauli strings get transformed asP7→λ w(P) P. Herew(P)is the weight ofP, i.e. the number of non-identity entries inP. From linearity of expectation values and the fact that we consider the homogeneous setting (both in decoherence and link success probability), we are free to consider...