pith. sign in

arxiv: 2605.03336 · v1 · submitted 2026-05-05 · 🪐 quant-ph

Centralizing Task-based Approach to Quantum Network Control

Alexander Pirker (1) , Robert J. Hayek (2) , Alexander Kolar (2 , 3) , Igor Kadota (4) , Joaquin Chung (2) , Rajkumar Kettimuthu (2) ((1) Quantum Network Design GmbH , (2) Argonne National Laboratory
show 1 more author
(3) University of Chicago (4) Northwestern University)
This is my paper

Pith reviewed 2026-05-07 17:35 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum networkscentralized controltask-based schedulingentanglement generationnetwork topologiespriority queueshigh-load performancesimulation evaluation
0
0 comments X

The pith

A centralized controller tracking memory availability and scheduling tasks with priorities enables scalable quantum network control without layered delays.

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

The paper sets out to replace layered quantum network architectures with a resource-centric task-based method run by a single centralized controller. This controller monitors available quantum memory at every node and assigns entanglement generation tasks offline according to priority. Simulations across large topologies demonstrate that the approach delivers more low-delay requests in grid and caveman layouts than in star networks, while priority queues saturate rapidly under rising load, confirming the framework stays effective when demand is high. Readers care because layered stacks add latency that degrades quantum state fidelity and limits practical network size.

Core claim

By implementing a centralized controller which tracks quantum memory availability across all nodes and schedules objectives in an offline fashion using a priority-based scheduler, the resource-centric task-based quantum network control framework is viable for scaling; caveman and grid topologies deliver higher fractions of low-delay requests than the star topology but also higher fractions of highly delayed requests, CDFs shift linearly with queue size and reservation delay for all topologies, and star-topology priority queues converge quickly into saturation as request arrival rates rise.

What carries the argument

The centralized controller that tracks quantum memory availability across nodes and schedules entanglement tasks offline with a priority-based scheduler.

If this is right

  • Caveman and grid topologies deliver a higher fraction of requests with low delay but also a higher fraction with high delay compared to the star topology.
  • Cumulative distribution functions for all topologies shift linearly as queue size varies with reservation delay.
  • Priority queues in the star topology reach saturation rapidly as request arrival rates increase, showing the framework handles high-load scenarios.

Where Pith is reading between the lines

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

  • The offline priority approach may reduce cumulative decoherence by shortening average wait times before entanglement is established.
  • Network designers could select topologies according to whether an application tolerates occasional long delays in exchange for more prompt deliveries.
  • The same centralized tracking mechanism could later support dynamic rerouting when nodes or links fail.

Load-bearing premise

The simulator and selected topologies with their reservation patterns accurately represent the timing constraints, memory lifetimes, and request behaviors of real quantum networks deployed at scale.

What would settle it

Running identical request arrival patterns and topologies on a physical quantum network testbed and checking whether the measured fractions of low-delay and high-delay deliveries match the simulation results.

Figures

Figures reproduced from arXiv: 2605.03336 by (2) Argonne National Laboratory, 3), (3) University of Chicago (4) Northwestern University), Alexander Kolar (2, Alexander Pirker (1), Igor Kadota (4), Joaquin Chung (2), Rajkumar Kettimuthu (2) ((1) Quantum Network Design GmbH, Robert J. Hayek (2).

Figure 1
Figure 1. Figure 1: The resource-centric, task-based approach to quantum view at source ↗
Figure 3
Figure 3. Figure 3: To achieve an objective, in principle several sagas could view at source ↗
Figure 2
Figure 2. Figure 2: The control flow for quantum networks adopting a view at source ↗
Figure 4
Figure 4. Figure 4: SeQUeNCe modular architecture of a node and the view at source ↗
Figure 6
Figure 6. Figure 6: Cumulative distribution function of request delay for view at source ↗
Figure 5
Figure 5. Figure 5: Network topologies. 2) Simulation Parameters: Table III presents our simulation parameters. For each node in a given topology, we set the number of quantum memories equal to the degree of the node. The quantum nodes in the simulation will use coher￾ence and error probability values following the modelling in [37]. Additionally, we use default SeQUeNCe values for attenuation, speed of light, and repetition … view at source ↗
Figure 9
Figure 9. Figure 9: Cumulative distribution function of request delay with view at source ↗
Figure 8
Figure 8. Figure 8: Histogram of the simulated entanglement fidelity view at source ↗
read the original abstract

For the last decade, layered stacks have dominated the way of reasoning about architectures for quantum networks. However, layered architectures impose stringent design and timing constraints on quantum networks, adding additional latency to the time required to serve an entanglement generation request. Moreover, increasing delays from the layered approach to network control causes degradation of state, effectively minimizing achievable fidelities. In this work we simulate a resource-centric, task-based approach to quantum network control by utilizing a centralized controller. Using the SeQUeNCe quantum network simulator, we implement the centralized controller which tracks quantum memory availability across all nodes, and schedules objectives in an offline fashion using a priority-based scheduler. We evaluate the performance of this controller on multiple topologies (bottleneck, grid, star, caveman) of significant scale, with varying reservation patterns; thereby we demonstrate the viability of the resource-centric task-based quantum network control framework for scaling. Our simulation results show that the caveman and grid topologies have a higher fraction of delivered requests with low delay compared to the star topology, but with a higher fraction of highly delayed requests as well. Furthermore, we find a linear shift of the CDFs in terms of queue size for all topologies depending on the reservation delay. More interestingly, we conclude that the CDFs of priority queues for the star topology converge fast into saturation for increasing request arrival rates, demonstrating together with the other results that the framework is robust for high load scenarios in quantum networks.

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

2 major / 2 minor

Summary. The paper proposes a resource-centric, task-based centralized controller for quantum network control as an alternative to layered architectures, using a priority-based offline scheduler that tracks quantum memory availability across nodes. It evaluates this framework via SeQUeNCe simulations on multiple topologies (bottleneck, grid, star, caveman) of significant scale under varying reservation patterns and request arrival rates, reporting that caveman and grid topologies yield higher fractions of low-delay delivered requests than star (with correspondingly higher high-delay fractions), linear CDF shifts with queue size and reservation delay across all topologies, and rapid saturation of priority-queue CDFs in the star topology at high loads, from which the authors conclude the framework is robust for scaling quantum networks.

Significance. If the simulation models prove representative, the work would offer comparative evidence that centralized task scheduling can reduce latency penalties relative to layering while maintaining performance under high request rates, with topology-specific insights into delay distributions. The multi-topology evaluation at scale is a strength that could inform controller design choices.

major comments (2)
  1. [§4 (Simulation Results) and §3 (Controller Implementation)] §4 (Simulation Results) and §3 (Controller Implementation): the viability claim for high-load robustness rests on the reported CDF shifts, saturation behavior, and topology comparisons, yet the manuscript provides no implementation details, specific parameter values (memory lifetimes, entanglement success probabilities, decoherence models), validation against benchmarks, error bars, or data-exclusion criteria. Without these, the quantitative outcomes cannot be independently verified or reproduced.
  2. [§4 (Evaluation on Topologies)] §4 (Evaluation on Topologies): the conclusion that the framework is robust for high-load scenarios assumes the SeQUeNCe models of timing constraints, memory lifetimes, and request queuing accurately reflect deployable quantum networks; no calibration to experimental data or sensitivity analysis on these parameters is described, leaving open the possibility that optimistic assumptions drive the observed saturation and delivery fractions.
minor comments (2)
  1. [Abstract] Abstract: the listed topologies include 'bottleneck' but the reported results emphasize only caveman, grid, and star; clarify whether bottleneck results were obtained and how they align with the linear-shift and saturation claims.
  2. [Notation and terminology] Notation and terminology: 'reservation delay' and 'priority queues' are used without explicit definitions or cross-references to the scheduler description; adding a short table of symbols or a dedicated subsection would improve clarity.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for the constructive feedback on our manuscript. We address each major comment below and will revise the paper to enhance reproducibility and clarify model assumptions.

read point-by-point responses

  1. Referee: [§4 (Simulation Results) and §3 (Controller Implementation)] §4 (Simulation Results) and §3 (Controller Implementation): the viability claim for high-load robustness rests on the reported CDF shifts, saturation behavior, and topology comparisons, yet the manuscript provides no implementation details, specific parameter values (memory lifetimes, entanglement success probabilities, decoherence models), validation against benchmarks, error bars, or data-exclusion criteria. Without these, the quantitative outcomes cannot be independently verified or reproduced.

    Authors: We agree that the current manuscript lacks sufficient implementation details for full reproducibility. In the revised version, we will expand §3 with a detailed description of the centralized controller implementation in SeQUeNCe, provide a complete list of simulation parameters (including memory lifetimes, entanglement success probabilities, and decoherence models), describe any benchmark validations performed, add error bars to all CDF plots in §4, and explicitly state the data exclusion criteria. These additions will enable independent verification of the reported results. revision: yes

  2. Referee: [§4 (Evaluation on Topologies)] §4 (Evaluation on Topologies): the conclusion that the framework is robust for high-load scenarios assumes the SeQUeNCe models of timing constraints, memory lifetimes, and request queuing accurately reflect deployable quantum networks; no calibration to experimental data or sensitivity analysis on these parameters is described, leaving open the possibility that optimistic assumptions drive the observed saturation and delivery fractions.

    Authors: We acknowledge that simulation-based conclusions depend on model fidelity. We will add a dedicated discussion subsection in §4 addressing the SeQUeNCe assumptions on timing constraints, memory lifetimes, and queuing behavior. We will also perform and report a sensitivity analysis on key parameters to quantify their influence on the observed CDF shifts and saturation behavior. Full calibration to experimental data from operational quantum networks is beyond the scope of this simulation study and will be noted as a limitation in the revised text. revision: partial

standing simulated objections not resolved
  • Full calibration of the SeQUeNCe models against experimental data from deployable quantum networks, as this is a simulation study without access to specific hardware characterizations.

Circularity Check

0 steps flagged

No derivation chain; results are direct simulation outputs

full rationale

The paper contains no mathematical derivations, equations, or fitted parameters that could reduce to self-referential inputs. All performance claims (CDF shifts, saturation behavior, topology comparisons) are presented as direct outputs from the SeQUeNCe simulator runs on chosen topologies and reservation patterns. No self-citations are invoked to justify uniqueness or load-bearing premises, and the evaluation remains independent of any internal redefinition or renaming of results.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The central claim rests entirely on the fidelity of the SeQUeNCe simulator and the representativeness of the chosen topologies and reservation patterns; no new physical axioms, free parameters, or invented entities are introduced or required by the abstract.

pith-pipeline@v0.9.0 · 5612 in / 1167 out tokens · 136426 ms · 2026-05-07T17:35:15.954373+00:00 · methodology

Review history (2 revisions) →

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

37 extracted references · 37 canonical work pages

  1. [1]

    Van Meter,Quantum networking

    R. Van Meter,Quantum networking. John Wiley & Sons, 2014

    work page 2014

  2. [2]

    Quantum cryptography based on Bell’s theorem,

    A. K. Ekert, “Quantum cryptography based on Bell’s theorem,”Phys. Rev. Lett., vol. 67, pp. 661–663, Aug 1991

    work page 1991

  3. [3]

    A quantum network of clocks,

    P. K ´om´ar, E. M. Kessler, M. Bishof, L. Jiang, A. S. Sørensen, J. Ye, and M. D. Lukin, “A quantum network of clocks,”Nature Physics, vol. 10, no. 8, pp. 582–587, 2014

    work page 2014

  4. [4]

    Universal blind quantum computation,

    A. Broadbent, J. Fitzsimons, and E. Kashefi, “Universal blind quantum computation,” in2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 517–526, 2009

    work page 2009

  5. [5]

    Distributed quantum sensing,

    Z. Zhang and Q. Zhuang, “Distributed quantum sensing,”Quantum Science and Technology, vol. 6, no. 4, p. 043001, 2021

    work page 2021

  6. [6]

    Development of quantum interconnects (quics) for next-generation information technologies,

    D. Awschalom, K. K. Berggren, H. Bernien, S. Bhave, L. D. Carr, P. Davids, S. E. Economou, D. Englund, A. Faraon, M. Fejer, S. Guha, M. V . Gustafsson, E. Hu, L. Jiang, J. Kim, B. Korzh, P. Kumar, P. G. Kwiat, M. Lon ˇcar, M. D. Lukin, D. A. Miller, C. Monroe, S. W. Nam, P. Narang, J. S. Orcutt, M. G. Raymer, A. H. Safavi- Naeini, M. Spiropulu, K. Sriniva...

    work page 2021

  7. [7]

    How to build a quantum supercomputer: Scaling from hundreds to millions of qubits,

    M. Mohseni, A. Scherer, K. G. Johnson, O. Wertheim, M. Otten, N. Anand, N. A. Aadit, Y . Alexeev, G. Ben-Shach, K. M. Bresniker, K. Y . Camsari, B. Chapman, S. Chatterjee, S. Chowdhury, G. A. Dagnew, T. Dvir, A. Esposito, F. Fahim, M. Ferguson, M. Fiorentino, A. Gajjar, K. Gratsea, G. Gyawali, C. Heiter, A. H. Z. Kavaki, A. Khalid, X. Kong, B. Kulchytskyy...

    work page 2026

  8. [8]

    Mind the gaps: The fraught road to quantum advantage,

    J. Eisert and J. Preskill, “Mind the gaps: The fraught road to quantum advantage,” 2025

    work page 2025

  9. [9]

    The quantum internet,

    H. J. Kimble, “The quantum internet,”Nature, vol. 453, no. 7198, pp. 1023–1030, 2008

    work page 2008

  10. [10]

    Quantum internet: A vision for the road ahead,

    S. Wehner, D. Elkouss, and R. Hanson, “Quantum internet: A vision for the road ahead,”Science, vol. 362, no. 6412, p. eaam9288, 2018

    work page 2018

  11. [11]

    RFC 9340 Architectural Principles for a Quantum Internet,

    W. Kozlowski, S. Wehner, R. Van Meter, B. Rijsman, A. S. Cacciapuoti, M. Caleffi, and S. Nagayama, “RFC 9340 Architectural Principles for a Quantum Internet,” tech. rep., RFC Editor, Mar. 2023

    work page 2023

  12. [12]

    System design for a long-line quantum repeater,

    R. Van Meter, T. D. Ladd, W. J. Munro, and K. Nemoto, “System design for a long-line quantum repeater,”IEEE/ACM Transactions on Networking, vol. 17, no. 3, pp. 1002–1013, 2009

    work page 2009

  13. [13]

    Recursive quantum repeater networks,

    R. Van Meter, J. Touch, and C. Horsman, “Recursive quantum repeater networks,”NII Journal, pp. 65–79, 3 2011

    work page 2011

  14. [14]

    A link layer protocol for quantum networks,

    A. Dahlberg, M. Skrzypczyk, T. Coopmans, L. Wubben, F. Rozpun- defineddek, M. Pompili, A. Stolk, P. Pawełczak, R. Knegjens, J. de Oliveira Filho, R. Hanson, and S. Wehner, “A link layer protocol for quantum networks,” inProceedings of the ACM Special Interest Group on Data Communication, SIGCOMM ’19, (New York, NY , USA), p. 159–173, Association for Compu...

    work page 2019

  15. [15]

    Towards large-scale quantum networks,

    W. Kozlowski and S. Wehner, “Towards large-scale quantum networks,” inProceedings of the Sixth Annual ACM International Conference on Nanoscale Computing and Communication, NANOCOM ’19, (New York, NY , USA), Association for Computing Machinery, 2019

    work page 2019

  16. [16]

    Designing a quantum network protocol,

    W. Kozlowski, A. Dahlberg, and S. Wehner, “Designing a quantum network protocol,” inProceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT ’20, (New York, NY , USA), p. 1–16, Association for Computing Machinery, 2020

    work page 2020

  17. [17]

    A quantum network stack and protocols for reliable entanglement-based networks,

    A. Pirker and W. D ¨ur, “A quantum network stack and protocols for reliable entanglement-based networks,”New Journal of Physics, vol. 21, p. 033003, mar 2019

    work page 2019

  18. [18]

    A quantum inter- net architecture,

    R. Van Meter, R. Satoh, N. Benchasattabuse, K. Teramoto, T. Matsuo, M. Hajduˇsek, T. Satoh, S. Nagayama, and S. Suzuki, “A quantum inter- net architecture,” in2022 IEEE International Conference on Quantum Computing and Engineering, pp. 341–352, IEEE, 2022

    work page 2022

  19. [19]

    A resource-centric, task-based approach to quantum network control,

    A. Pirker, B. Munoz, and W. D ¨ur, “A resource-centric, task-based approach to quantum network control,” July 2025. arXiv:2507.12030 [quant-ph]

    work page arXiv 2025

  20. [20]

    A quantum internet protocol suite beyond layering,

    A. S. Cacciapuoti and M. Caleffi, “A quantum internet protocol suite beyond layering,” 2026

    work page 2026

  21. [21]

    Design and implementation of the illinois express quantum metropolitan area network,

    J. Chung, E. M. Eastman, G. S. Kanter, K. Kapoor, N. Lauk, C. H. Pe˜na, R. K. Plunkett, N. Sinclair, J. M. Thomas, R. Valivarthi, S. Xie, R. Kettimuthu, P. Kumar, P. Spentzouris, and M. Spiropulu, “Design and implementation of the illinois express quantum metropolitan area network,”IEEE Transactions on Quantum Engineering, vol. 3, pp. 1–20, 2022

    work page 2022

  22. [22]

    A modular quantum network architecture for integrating network scheduling with local program execution,

    T. R. Beauchamp, H. Jirovsk ´a, S. Gauthier, and S. Wehner, “A modular quantum network architecture for integrating network scheduling with local program execution,” 2025

    work page 2025

  23. [23]

    The quant-net testbed development and pre- liminary results,

    D. Schon, P. Umesh, Y .-W. Cheah, S.-Y . Yu, E. Kissel, R. Valivarthi, E. Saglamyurek, L. Ramakrishnan, W. Wu, A. Sipahigil, M. Spiropulu, H. H¨affner, and I. Monga, “The quant-net testbed development and pre- liminary results,” in2024 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 01, pp. 1799–1808, 2024

    work page 2024

  24. [24]

    A two-level control framework for quantum networks,

    S.-y. Yu, E. Perego, J. Phillips, Y .-W. Cheah, P. Umesh, G. Gao, J. Liu, E. Kissel, M. Bregar, K. Sun, Q. Wu, R. Valivarthi, E. Saglamyurek, W. Wu, M. Spiropulu, H. H¨affner, and I. Monga, “A two-level control framework for quantum networks,” inThe 2025 IEEE International Conference on Quantum Computing and Engineering, 2025

    work page 2025

  25. [25]

    Sequence: a customizable discrete-event simulator of quantum networks,

    X. Wu, A. Kolar, J. Chung, D. Jin, T. Zhong, R. Kettimuthu, and M. Suchara, “Sequence: a customizable discrete-event simulator of quantum networks,”Quantum Science and Technology, vol. 6, sep 2021

    work page 2021

  26. [26]

    central task based control

    R. Hayek and A. Kolar, “central task based control.”

    work page

  27. [27]

    OSI Reference Model - The ISO Model of Ar- chitecture for Open Systems Interconnection,

    H. Zimmermann, “OSI Reference Model - The ISO Model of Ar- chitecture for Open Systems Interconnection,”IEEE Transactions on Communications, vol. 28, pp. 425–432, April 1980

    work page 1980

  28. [28]

    Adaptive strategies for graph-state growth in the presence of monitored errors,

    E. T. Campbell, J. Fitzsimons, S. C. Benjamin, and P. Kok, “Adaptive strategies for graph-state growth in the presence of monitored errors,” Phys. Rev. A, vol. 75, p. 042303, Apr 2007

    work page 2007

  29. [29]

    Designing quantum repeater networks,

    R. V . Meter and J. Touch, “Designing quantum repeater networks,”IEEE Communications Magazine, vol. 51, no. 8, pp. 64–71, 2013

    work page 2013

  30. [30]

    Optimal architectures for long distance quantum communica- tion,

    S. Muralidharan, L. Li, J. Kim, N. L ¨utkenhaus, M. D. Lukin, and L. Jiang, “Optimal architectures for long distance quantum communica- tion,”Scientific Reports, vol. 6, p. 20463, Feb 2016

    work page 2016

  31. [31]

    Modular architectures for quantum networks,

    A. Pirker, J. Walln ¨ofer, and W. D¨ur, “Modular architectures for quantum networks,”New Journal of Physics, vol. 20, p. 053054, may 2018

    work page 2018

  32. [32]

    Graph state extraction from two-dimensional cluster states,

    J. Freund, A. Pirker, L. Vandr ´e, and W. D ¨ur, “Graph state extraction from two-dimensional cluster states,”New Journal of Physics, vol. 27, p. 094505, sep 2025

    work page 2025

  33. [33]

    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,”Phys. Rev. Lett., vol. 76, pp. 722–725, Jan 1996

    work page 1996

  34. [34]

    Entanglement distribution in quantum repeater with purification and optimized buffer time,

    A. Zang, X. Chen, A. Kolar, J. Chung, M. Suchara, T. Zhong, and R. Kettimuthu, “Entanglement distribution in quantum repeater with purification and optimized buffer time,” inIEEE INFOCOM Workshops, pp. 1–6, 2023

    work page 2023

  35. [35]

    Exploring Network Structure, Dynamics, and Function using NetworkX,

    A. A. Hagberg, D. A. Schult, and P. J. Swart, “Exploring Network Structure, Dynamics, and Function using NetworkX,” inProceedings of the 7th Python in Science Conference(G. Varoquaux, T. Vaught, and J. Millman, eds.), (Pasadena, CA USA), pp. 11 – 15, 2008

    work page 2008

  36. [36]

    An optical interconnect for modular quantum computers,

    D. Sakuma, T. Tsuno, H. Shimizu, Y . Kurosawa, M. T. Friedrich, K. Ter- amoto, A. Taherkhani, A. Todd, Y . Ueno, M. Hajdu ˇsek, R. Ikuta, R. V . Meter, T. Sasaki, and S. Nagayama, “Q-Fly: An Optical Interconnect for Modular Quantum Computers,” Dec. 2025. arXiv:2412.09299 [quant- ph]

    work page arXiv 2025

  37. [37]

    Simulation of a heterogeneous quantum network,

    H. Miller, C. Zhan, M. Bishof, J. Chung, H. Xu, P. Kumar, and R. Kettimuthu, “Simulation of a heterogeneous quantum network,” in International Conference on Quantum Communications, Networking, and Computing (QCNC), April 2026. GOVERNMENTLICENSE The submitted manuscript has been created by UChicago Argonne, LLC, Operator of Argonne National Laboratory (“Ar...

    work page 2026