pith. sign in

arxiv: 2503.12582 · v1 · submitted 2025-03-16 · 🪐 quant-ph · cs.NI

A Modular Quantum Network Architecture for Integrating Network Scheduling with Local Program Execution

Thomas R. Beauchamp , Hana Jirovsk\'a , Scarlett Gauthier , Stephanie Wehner This is my paper

Pith reviewed 2026-05-23 00:10 UTC · model grok-4.3

classification 🪐 quant-ph cs.NI
keywords quantum networksentanglement schedulingmodular architectureadmission controlentanglement packetsquantum applicationsnetwork simulation
0
0 comments X

The pith

A modular architecture integrates network scheduling with local quantum program execution via entanglement packets.

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

The paper proposes an architecture that schedules the end-to-end generation of entanglement on demand while allowing quantum programs to execute on the processing nodes. The key innovation is the definition of an entanglement packet that aligns network resources with application needs despite limited qubit lifetimes. The design is kept fully modular and hardware-agnostic so that individual components can be developed separately. A proof-of-concept simulation on a six-node star network shows the approach supports application execution but also reveals that strong admission control is essential to preserve quality of service.

Core claim

The architecture enables the execution of quantum network applications by defining an entanglement packet that meets application requirements on near-term networks with limited qubit lifetimes at the end nodes, and the simulated evaluation demonstrates that robust admission control is required to maintain quality of service.

What carries the argument

The entanglement packet, a structure that specifies the entanglement generation requirements needed to support a local quantum program under realistic lifetime constraints.

If this is right

  • Quantum network applications can run according to user-specified demand once the schedule and local execution are coordinated through packets.
  • Individual network components such as schedulers or local controllers can be researched and implemented independently.
  • Admission control policies become necessary to prevent overload and preserve quality of service.
  • Potential bottlenecks in the current design can be isolated for targeted improvements.

Where Pith is reading between the lines

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

  • Standard interfaces between the scheduler and local processors could emerge from the modular separation.
  • Real hardware deployments would need to verify whether packet lifetimes match the shortest qubit coherence times present.
  • The star-topology simulation could be extended to test whether the same packet mechanism scales to different topologies without redesign.

Load-bearing premise

The definition of an entanglement packet can meet application requirements on near-term quantum networks where the lifetimes of the qubits stored at the end nodes are limited.

What would settle it

A test case on the simulated network in which the entanglement packet cannot be delivered before the qubits decohere, preventing the local program from completing its required operations.

Figures

Figures reproduced from arXiv: 2503.12582 by Hana Jirovsk\'a, Scarlett Gauthier, Stephanie Wehner, Thomas R. Beauchamp.

Figure 1
Figure 1. Figure 1: A general quantum network may be built from four kinds of devices: end nodes, metropolitan hubs, repeater [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Example of an entanglement generation protocol [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Flow of information through the stages of the architecture. The processes of ‘Network Capability Update’ [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Example of the timings for computing, distributing and executing the [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Interaction Diagram for our proposed quantum network architecture. Elements in red are local software [PITH_FULL_IMAGE:figures/full_fig_p011_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Excerpt from an example network schedule with two PGTs [PITH_FULL_IMAGE:figures/full_fig_p012_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Example of a star-topology network with 6 [PITH_FULL_IMAGE:figures/full_fig_p016_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Results from simulations for peer-to-peer [PITH_FULL_IMAGE:figures/full_fig_p019_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Results from simulations for client-server [PITH_FULL_IMAGE:figures/full_fig_p020_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Times taken for our computational server to compute network schedules. The server has an Intel [PITH_FULL_IMAGE:figures/full_fig_p034_10.png] view at source ↗
read the original abstract

We propose an architecture for scheduling network operations enabling the end-to-end generation of entanglement according to user demand. The main challenge solved by this architecture is to allow for the integration of a network schedule with the execution of quantum programs running on processing end nodes in order to realise quantum network applications. A key element of this architecture is the definition of an entanglement packet to meet application requirements on near-term quantum networks where the lifetimes of the qubits stored at the end nodes are limited. Our architecture is fully modular and hardware agnostic, and defines a framework for further research on specific components that can now be developed independently of each other. In order to evaluate our architecture, we realise a proof of concept implementation on a simulated 6-node network in a star topology. We show our architecture facilitates the execution of quantum network applications, and that robust admission control is required to maintain quality of service. Finally, we comment on potential bottlenecks in our architecture and provide suggestions for future improvements.

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

Summary. The paper proposes a modular, hardware-agnostic quantum network architecture that integrates network scheduling with local quantum program execution on end nodes to enable on-demand end-to-end entanglement generation. A central element is the definition of an 'entanglement packet' intended to satisfy application requirements despite limited qubit lifetimes at end nodes. The architecture is evaluated via a proof-of-concept simulation on a 6-node star topology, which demonstrates facilitation of quantum network applications and the necessity of robust admission control to maintain quality of service. The authors also discuss potential bottlenecks and future improvements.

Significance. If validated, the modular framework would allow independent development of scheduling, packet handling, and execution components, addressing a practical integration challenge for near-term quantum networks. The PoC provides initial evidence that admission control is required for QoS, and the hardware-agnostic design is a constructive contribution. However, the significance is constrained by the limited scope of the evaluation, which does not yet demonstrate the entanglement packet's effectiveness under realistic decoherence constraints.

major comments (2)
  1. [Evaluation / PoC simulation] Evaluation section (PoC simulation): The 6-node star topology simulation is presented as supporting the claim that the entanglement packet meets application requirements on near-term networks with limited qubit lifetimes, but the description provides no explicit modeling of decoherence times, storage constraints, or non-ideal timing effects. Without these, it is unclear whether the observed QoS behavior validates the packet construct or arises from idealized assumptions.
  2. [Architecture definition] Architecture definition (entanglement packet): The central claim that the entanglement packet enables application execution despite limited end-node qubit lifetimes is load-bearing, yet the manuscript does not specify quantitative lifetime thresholds, packet lifetime bounds, or how the packet construct interacts with decoherence in the scheduling framework.
minor comments (1)
  1. [Abstract / Introduction] The abstract and introduction would benefit from a brief comparison to prior quantum network scheduling proposals to clarify novelty.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We appreciate the referee's constructive comments, which identify key areas where the manuscript's evaluation and architecture presentation can be strengthened. We address each major comment below and indicate the revisions we will make.

read point-by-point responses

  1. Referee: [Evaluation / PoC simulation] Evaluation section (PoC simulation): The 6-node star topology simulation is presented as supporting the claim that the entanglement packet meets application requirements on near-term networks with limited qubit lifetimes, but the description provides no explicit modeling of decoherence times, storage constraints, or non-ideal timing effects. Without these, it is unclear whether the observed QoS behavior validates the packet construct or arises from idealized assumptions.

    Authors: We agree that the PoC simulation is idealized and does not incorporate explicit models of decoherence times, storage constraints, or non-ideal timing. The simulation is designed to demonstrate the integration of network scheduling with local program execution and the necessity of admission control for QoS under the architecture's timing abstractions, rather than to validate physical-layer effects. The observed behavior follows from the packet-enforced scheduling constraints. In revision we will explicitly state these idealized assumptions in the evaluation section and add discussion of how decoherence would be incorporated into the packet scheduling framework in a more detailed model. revision: yes

  2. Referee: [Architecture definition] Architecture definition (entanglement packet): The central claim that the entanglement packet enables application execution despite limited end-node qubit lifetimes is load-bearing, yet the manuscript does not specify quantitative lifetime thresholds, packet lifetime bounds, or how the packet construct interacts with decoherence in the scheduling framework.

    Authors: The entanglement packet is defined as a hardware-agnostic timing abstraction that allows the scheduler to meet application requirements while respecting end-node qubit lifetime limits. No specific numerical thresholds appear in the manuscript because the architecture is intentionally general and such values are hardware- and application-dependent. We will revise the architecture section to include representative lifetime bounds drawn from near-term hardware and to describe the packet's interaction with decoherence within the scheduling process, thereby making the central claim more concrete while preserving modularity. revision: partial

Circularity Check

0 steps flagged

No circularity: architecture proposal with independent PoC simulation validation

full rationale

The paper proposes a modular, hardware-agnostic architecture for integrating network scheduling with local quantum program execution on end nodes. Its central element is a conceptual definition of an entanglement packet intended to satisfy application requirements given limited qubit lifetimes at end nodes. Evaluation consists of a proof-of-concept implementation and simulation on a 6-node star topology that demonstrates application facilitation and the need for admission control. No equations, fitted parameters, predictions derived from subsets of data, or self-citation chains appear in the provided text that would reduce any claim to an input by construction. The simulation functions as external validation of the framework rather than a tautological restatement of its definitions. This is the expected outcome for an architecture paper whose claims rest on design modularity and empirical demonstration rather than mathematical derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 1 invented entities

Abstract-only review; no explicit free parameters, axioms, or additional invented entities beyond the entanglement packet can be extracted.

invented entities (1)
  • entanglement packet no independent evidence
    purpose: To meet application requirements on near-term quantum networks where qubit lifetimes are limited
    Defined as key element of the architecture; no independent evidence or falsifiable prediction provided in abstract.

pith-pipeline@v0.9.0 · 5704 in / 1187 out tokens · 65389 ms · 2026-05-23T00:10:38.085461+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

98 extracted references · 98 canonical work pages · 4 internal anchors

  1. [1]

    Quantum cryptography based on bell’s theorem,

    A. K. Ekert, “Quantum cryptography based on Bell’s theorem,” Physical Review Letters , vol. 67, no. 6, pp. 661–663, Aug. 1991. [Online]. Available: https: //link.aps.org/doi/10.1103/PhysRevLett.67.661

    work page doi:10.1103/physrevlett.67.661 1991

  2. [2]

    Quantum cryptography: Public key distribution and coin tossing,

    C. H. Bennett and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” inProceedings of the International Conference on Computers, Systems & Signal Processing, Bangalore, India, vol. 1. IEEE, 1984, pp. 175–179

    work page 1984

  3. [3]

    Blind quantum computation,

    P. Arright and L. Salvail, “Blind quantum computation,” International Journal of Quantum Information, vol. 04, no. 05, pp. 883–898, 2006

    work page 2006

  4. [4]

    Univer- sal Blind Quantum Computation,

    A. Broadbent, J. Fitzsimons, and E. Kashefi, “Univer- sal Blind Quantum Computation,” in2009 50th Annual IEEE Symposium on Foundations of Computer Science. Atlanta, Georgia, USA: IEEE, Oct. 2009, pp. 517–526

    work page 2009

  5. [5]

    Secure assisted quantum computation

    A. M. Childs, “Secure assisted quantum computation,” Quantum Information and Computation, vol. 5, no. 6, 2005, arXiv:quant-ph/0111046. [Online]. Available: http: //arxiv.org/abs/quant-ph/0111046

    work page internal anchor Pith review Pith/arXiv arXiv 2005

  6. [6]

    Exact Quantum Algorithms for the Leader Election Problem,

    S. Tani, H. Kobayashi, and K. Matsumoto, “Exact Quantum Algorithms for the Leader Election Problem,” ACM Transactions on Computation Theory , vol. 4, no. 1, pp. 1–24, Mar. 2012. [Online]. Available: https://dl.acm.org/doi/10.1145/2141938.2141939 21

    work page doi:10.1145/2141938.2141939 2012

  7. [7]

    Quantum internet: A vision for the road ahead,

    S. Wehner, D. Elkouss, and R. Hanson, “Quantum internet: A vision for the road ahead,” Science, Oct. 2018, publisher: American Association for the Advancement of Science. [Online]. Available: https: //www.science.org/doi/10.1126/science.aam9288

    work page doi:10.1126/science.aam9288 2018

  8. [8]

    Can quantum-mechanical description of physical reality be considered complete

    A. Einstein, B. Podolsky, and N. Rosen, “Can quantum-mechanical description of physical reality be considered complete?” Physical Review , vol. 47, no. 10, pp. 777–780, 1935. [Online]. Available: https: //link.aps.org/doi/10.1103/PhysRev.47.777

    work page doi:10.1103/physrev.47.777 1935

  9. [9]

    M. A. Nielsen and I. L. Chuang, Quan- tum Computation and Quantum Information: 10th Anniversary Edition . Cambridge Univer- sity Press, 2010, ISBN: 9780511976667 Publisher: Cambridge University Press. [Online]. Available: https://www.cambridge.org/highereducation/books/ quantum-computation-and-quantum-information/ 01E10196D0A682A6AEFFEA52D53BE9AE

    work page 2010

  10. [10]

    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, pp. 169–181, Jan. 1999, publisher: American Physical Society. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.59.169

    work page doi:10.1103/physreva.59.169 1999

  11. [12]

    Optimal entanglement distribution policies in homo- geneous repeater chains with cutoffs,

    Á. G. Iñesta, G. Vardoyan, L. Scavuzzo, and S. Wehner, “Optimal entanglement distribution policies in homo- geneous repeater chains with cutoffs,” npj Quantum Information, vol. 9, no. 1, pp. 1–7, May 2023, number: 1 Publisher: Nature Publishing Group. [Online]. Available: https://www.nature.com/articles/s41534-023-00713-9

    work page 2023

  12. [13]

    Creation of entangled states of distant atoms by interference,

    C. Cabrillo, J. I. Cirac, P. García-Fernández, and P. Zoller, “Creation of entangled states of distant atoms by interference,” Physical Review A , vol. 59, no. 2, pp. 1025–1033, Feb. 1999. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.59.1025

    work page doi:10.1103/physreva.59.1025 1999

  13. [14]

    Robust quantum-network memory based on spin qubits in isotopically engineered diamond,

    C. E. Bradley, S. W. de Bone, P. F. W. Moller, S. Baier, M. J. Degen, S. J. H. Loenen, H. P. Bartling, M. Markham, D. J. Twitchen, R. Hanson, D. Elkouss, and T. H. Taminiau, “Robust quantum-network memory based on spin qubits in isotopically engineered diamond,” Nov. 2021, arXiv:2111.09772 [cond-mat, physics:quant-ph]. [Online]. Available: http://arxiv.or...

    work page arXiv 2021

  14. [16]

    Qoala: an application execution environment for quantum internet nodes,

    B. van der Vecht, A. T. Yücel, H. Jirovská, and S. Wehner, “Qoala: an application execution environment for quantum internet nodes,” 2025, arXiv:2502.17296 [quant- ph]. [Online]. Available: http://arxiv.org/abs/2502.17296

    work page arXiv 2025

  15. [17]

    Data and code for

    T. R. Beauchamp, H. Jirovská, S. Gauthier, and S. Wehner, “Data and code for "a modular quantum net- work architecture for integrating network scheduling with local program execution.",” 2025, doi: 10.4121/71317dee- 089c-4507-8f85-6a4718c4b8d7

    work page doi:10.4121/71317dee- 2025

  16. [18]

    Esdi: En- tanglement scheduling and distribution in the quantum internet,

    H. Gu, R. Yu, Z. Li, X. Wang, and F. Zhou, “Esdi: En- tanglement scheduling and distribution in the quantum internet,”2023 32nd International Conference on Com- puter Communications and Networks (ICCCN), pp. 1–10, 2023

    work page 2023

  17. [19]

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

    A. Pirker and W. Dür, “A quantum network stack and protocols for reliable entanglement-based networks,” New Journal of Physics , vol. 21, no. 3, p. 033003, 2019, publisher: IOP Publishing. [Online]. Available: https://dx.doi.org/10.1088/1367-2630/ab05f7

    work page doi:10.1088/1367-2630/ab05f7 2019

  18. [20]

    Experimental demonstration of entanglement delivery using a quantum network stack,

    M. Pompili, C. Delle Donne, I. te Raa, B. van der Vecht, M. Skrzypczyk, G. Ferreira, L. de Kluijver, A. J. Stolk, S. L. N. Hermans, P. Pawełczak, W. Kozlowski, R. Hanson, and S. Wehner, “Experimental demonstration of entanglement delivery using a quantum network stack,” npj Quantum Information , vol. 8, no. 1, pp. 1–10, Oct. 2022, number: 1 Publisher: Nat...

    work page 2022

  19. [21]

    A Link Layer Protocol for Quantum Networks,

    A. Dahlberg, M. Skrzypczyk, T. Coopmans, L. Wubben, F. Rozpędek, M. Pompili, A. Stolk, P. Pawełczak, R. Knegjens, J. d. O. Filho, R. Hanson, and S. Wehner, “A Link Layer Protocol for Quantum Networks,” inProceedings of the ACM Special Interest Group on Data Communication, Aug. 2019, pp. 159– 173, arXiv:1903.09778 [quant-ph]. [Online]. Available: http://ar...

    work page arXiv 2019

  20. [22]

    Tools for the analysis of quantum protocols requiring state generation within a time window,

    B. Davies, T. Beauchamp, G. Vardoyan, and S. Wehner, “Tools for the analysis of quantum protocols requiring state generation within a time window,”IEEE Transac- tions on Quantum Engineering, 2024. [Online]. Available: https://ieeexplore.ieee.org/document/10417724/

    work page arXiv 2024

  21. [23]

    Approximations for Distributions of Scan Statistics,

    J. I. Naus, “Approximations for Distributions of Scan Statistics,” Journal of the American Statistical Association, vol. 77, no. 377, pp. 177–183, 1982, publisher: [American Statistical Association, Taylor & Francis, Ltd.]. [Online]. Available: https://www.jstor. org/stable/2287786

    work page arXiv 1982

  22. [24]

    J. Glaz, J. I. Naus, and S. Wallenstein,Scan statistics, ser. Springer series in statistics. New York: Springer, 2001

    work page 2001

  23. [25]

    An Architecture for Meeting Quality-of-Service Requirements in Multi-User Quantum Networks,

    M. Skrzypczyk and S. Wehner, “An Architecture for Meeting Quality-of-Service Requirements in Multi-User Quantum Networks,” Nov. 2021, arXiv:2111.13124 [quant- ph]. [Online]. Available: http://arxiv.org/abs/2111.13124

    work page arXiv 2021

  24. [26]

    Request Scheduling in Quantum Networks,

    C. Cicconetti, M. Conti, and A. Passarella, “Request Scheduling in Quantum Networks,”IEEE Transactions on Quantum Engineering, vol. 2, pp. 2–17, 2021. [On- line]. Available: https://ieeexplore.ieee.org/document/ 9461156/

    work page 2021

  25. [27]

    A Quantum Internet Architecture,

    R. Van Meter, R. Satoh, N. Benchasattabuse, T. Mat- suo, M. Hajdušek, T. Satoh, S. Nagayama, and S. Suzuki, “A Quantum Internet Architecture,” in 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), Sep. 2022, pp. 341– 352, arXiv:2112.07092 [quant-ph]. [Online]. Available: http://arxiv.org/abs/2112.07092 22

    work page arXiv 2022

  26. [28]

    Software-Defined Networking: A Comprehensive Survey,

    D.Kreutz, F.M.V.Ramos, P.E.Veríssimo, C.E.Rothen- berg, S. Azodolmolky, and S. Uhlig, “Software-Defined Networking: A Comprehensive Survey,”Proceedings of the IEEE, vol. 103, no. 1, pp. 14–76, Jan. 2015, conference Name: Proceedings of the IEEE

    work page 2015

  27. [29]

    OpenFlow: enabling innovation in campus networks,

    N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, “OpenFlow: enabling innovation in campus networks,” ACM SIGCOMM Computer Communication Review , vol. 38, no. 2, pp. 69–74, Mar. 2008. [Online]. Available: https://dl.acm.org/doi/10.1145/1355734.1355746

    work page doi:10.1145/1355734.1355746 2008

  28. [30]

    Forwarding and Control Element Separation (ForCES) Protocol Specification,

    J. M. Halpern, R. HAAS, a. doria, L. Dong, W. Wang, H. M. Khosravi, J. H. Salim, and R. Gopal, “Forwarding and Control Element Separation (ForCES) Protocol Specification,” Internet Engineering Task Force, Request for Comments RFC 5810, Mar. 2010, num Pages:

    work page 2010

  29. [31]

    Available: https://datatracker.ietf.org/ doc/rfc5810

    [Online]. Available: https://datatracker.ietf.org/ doc/rfc5810

    work page

  30. [32]

    A p4 data plane for the quantum internet,

    W. Kozlowski, F. Kuipers, and S. Wehner, “A p4 data plane for the quantum internet,” in Proceedings of the 3rd P4 Workshop in Europe. ACM, 2020, pp. 49–51. [Online]. Available: https://dl.acm.org/doi/10. 1145/3426744.3431321

    work page arXiv 2020

  31. [33]

    Reconfigurable Quantum Internet Service Provider,

    Z. Yang and C. Cui, “Reconfigurable Quantum Internet Service Provider,” May 2023, arXiv:2305.09048 [quant- ph]. [Online]. Available: http://arxiv.org/abs/2305.09048

    work page arXiv 2023

  32. [34]

    Software-defined quantum network using a QKD- secured SDN controller and encrypted messages,

    R. S. Tessinari, R. I. Woodward, and A. J. Shields, “Software-defined quantum network using a QKD- secured SDN controller and encrypted messages,” May 2023, arXiv:2305.12893 [quant-ph]. [Online]. Available: http://arxiv.org/abs/2305.12893

    work page arXiv 2023

  33. [35]

    MadQCI: a heterogeneous and scalable SDN QKD network deployed in production facilities

    V. Martin, J. P. Brito, L. Ortiz, R. B. Mendez, J. S. Buruaga, R. J. Vicente, A. Sebastián-Lombraña, D. Rincon, F. Perez, C. Sanchez, M. Peev, H. H. Brunner, F. Fung, A. Poppe, F. Fröwis, A. J. Shields, R. I. Woodward, H. Griesser, S. Roehrich, F. De La Iglesia, C. Abellan, M. Hentschel, J. M. Rivas-Moscoso, A. Pastor, J. Folgueira, and D. R. Lopez, “MadQ...

    work page arXiv

  34. [36]

    Quantum-aware software defined networks,

    A. Aguado, V. Martin, D. Lopez, M. Peev, J. Martinez- Mateo, J. L. Rosales, F. de la Iglesia, M. Gomez, E. Hugues Salas, A. Lord, R. Nejabati, and D. Sime- onidou, “Quantum-aware software defined networks,” in 6th International Conference on Quantum Cryptography (QCRYPT 2016). QCrypt, 2016

    work page 2016

  35. [37]

    Software defined quantum key distribution network,

    W. Yu, B. Zhao, and Z. Yan, “Software defined quantum key distribution network,” in2017 3rd IEEE International Conference on Computer and Communications (ICCC). IEEE, 2017, pp. 1293–1297. [Online]. Available: http: //ieeexplore.ieee.org/document/8322751/

    work page arXiv 2017

  36. [38]

    Secure NFV orchestration over an SDN- controlled optical network with time-shared quantum key distribution resources,

    A. Aguado, E. Hugues-Salas, P. A. Haigh, J. Marhuenda, A. B. Price, P. Sibson, J. E. Kennard, C. Erven, J. G. Rarity, M. G. Thompson, A. Lord, R. Nejabati, and D. Simeonidou, “Secure NFV orchestration over an SDN- controlled optical network with time-shared quantum key distribution resources,”Journal of Lightwave Technology, vol. 35, no. 8, pp. 1357–1362, 2017

    work page 2017

  37. [39]

    Quantum-key- distribution (QKD) networks enabled by software- defined networks (SDN),

    H. Wang, Y. Zhao, and A. Nag, “Quantum-key- distribution (QKD) networks enabled by software- defined networks (SDN),” Applied Sciences, vol. 9, no. 10, p. 2081, 2019. [Online]. Available: https: //www.mdpi.com/2076-3417/9/10/2081

    work page 2081

  38. [40]

    Network slicing-based and QoS-oriented software-defined quantum key distribution network,

    X. Wang, T. Chen, Y. Du, J. He, and C. Zhu, “Network slicing-based and QoS-oriented software-defined quantum key distribution network,” in2023 International Conference on Ubiquitous Communication (Ucom), 2023, pp. 397–402. [Online]. Available: https://ieeexplore.ieee. org/document/10257658

    work page arXiv 2023

  39. [41]

    Quantum key distribution (QKD) for wireless networks with software-defined networking,

    H. S. Hadi and A. J. Obaid, “Quantum key distribution (QKD) for wireless networks with software-defined networking,” Internet Technol- ogy Letters , vol. n/a, p. e547, 2024, _eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1002/itl2.547. [Online]. Available: https://onlinelibrary.wiley.com/doi/ abs/10.1002/itl2.547

    work page doi:10.1002/itl2.547 2024

  40. [42]

    SDN-enabled continuous-variable QKD in coexistence with 8×200 gb/s 16-QAM classical channels,

    M. Iqbal, A. Villegas, M. S. Moreolo, L. Nadal, R. Muñoz, P. Adillon, S. Sarmiento, J. Tabares, and S. Etcheverry, “SDN-enabled continuous-variable QKD in coexistence with 8×200 gb/s 16-QAM classical channels,” in2024 International Conference on Optical Network Design and Modeling (ONDM) , 2024, pp. 1–3. [Online]. Available: https://ieeexplore.ieee.org/ d...

    work page arXiv 2024

  41. [43]

    ChaQra: a cellular unit of the indian quantum network,

    S. Gupta, I. Agarwal, V. Mogiligidda, R. Kumar Krish- nan, S. Chennuri, D. Aggarwal, A. Hoodati, S. Cooper, Ranjan, M. Bilal Sheik, K. M. Bhavya, M. Hegde, M. N. Krishna, A. K. Chauhan, M. Korrapati, S. Singh, J. B. Singh, S. Sud, S. Gupta, S. Pant, Sankar, N. Agrawal, A. Ranjan, P. Mohapatra, T. Roopak, A. Ahmad, M. Nanjunda, and D. Singh, “ChaQra: a cel...

    work page 2024

  42. [44]

    Quantum key distribution (QKD): Control interface for software defined networks,

    Quantum Key Distribution Industry Specification Group, “Quantum key distribution (QKD): Control interface for software defined networks,” European Telecommunica- tions Standards Institute, Tech. Rep., 2024. [Online]. Available: https://www.etsi.org/deliver/etsi_gs/QKD/ 001_099/015/02.01.01_60/gs_QKD015v020101p.pdf

    work page 2024

  43. [45]

    Combined task- and network-level scheduling for distributed time-triggered systems,

    S. S. Craciunas and R. S. Oliver, “Combined task- and network-level scheduling for distributed time-triggered systems,”Real-Time Systems, vol. 52, no. 2, pp. 161–200,

    work page

  44. [46]

    Available: http://link.springer.com/10

    [Online]. Available: http://link.springer.com/10. 1007/s11241-015-9244-x

    work page

  45. [47]

    TTEthernet (time- triggered ethernet) - eoPortal,

    H. J. Kramer, “TTEthernet (time- triggered ethernet) - eoPortal,” re- trieved from https://www.eoportal.org/satellite- missions/ttethernet on 2023-10-30. [Online]. Available: https://www.eoportal.org/satellite-missions/ttethernet

    work page 2023

  46. [48]

    NASA’s orion spacecraft,

    TTTech, “NASA’s orion spacecraft,” retrieved from: https://www.tttech.com/aerospace/resources/case- studies/nasa-orion on 2023-10-30. [Online]. Avail- able: https://www.tttech.com/aerospace/resources/ case-studies/nasa-orion

    work page 2023

  47. [49]

    Quantum networks based on color centers in diamond,

    M. Ruf, N. H. Wan, H. Choi, D. Englund, and R. Hanson, “Quantum networks based on color centers in diamond,” Journal of Applied Physics , vol. 130, no. 7, p. 070901, Aug. 2021. [Online]. Available: https://doi.org/10.1063/5.0056534

    work page doi:10.1063/5.0056534 2021

  48. [50]

    Realization of a multinode quantum network of remote solid- state qubits,

    M. Pompili, S. L. N. Hermans, S. Baier, H. K. C. Beukers, P. C. Humphreys, R. N. Schouten, R. F. L. 23 Vermeulen, M. J. Tiggelman, L. dos Santos Martins, B. Dirkse, S. Wehner, and R. Hanson, “Realization of a multinode quantum network of remote solid- state qubits,” Science, vol. 372, no. 6539, pp. 259– 264, Apr. 2021, publisher: American Association for ...

    work page doi:10.1126/science.abg1919 2021

  49. [51]

    Entanglement of trapped-ion qubits separated by 230 meters,

    V. Krutyanskiy, M. Galli, V. Krcmarsky, S. Baier, D. A. Fioretto, Y. Pu, A. Mazloom, P. Sekatski, M. Canteri, M. Teller, J. Schupp, J. Bate, M. Meraner, N. Sangouard, B. P. Lanyon, and T. E. Northup, “Entanglement of trapped-ion qubits separated by 230 meters,”Phys. Rev. Lett., vol. 130, p. 050803, Feb

    work page

  50. [52]

    Available: https://link.aps.org/doi/10

    [Online]. Available: https://link.aps.org/doi/10. 1103/PhysRevLett.130.050803

    work page

  51. [53]

    Quantum interfer- ence of photon pairs from two remote trapped atomic ions,

    P. Maunz, D. L. Moehring, S. Olmschenk, K. C. Younge, D. N. Matsukevich, and C. Monroe, “Quantum interfer- ence of photon pairs from two remote trapped atomic ions,”Nature Physics, vol. 3, no. 8, pp. 538–541, 2007

    work page 2007

  52. [54]

    Quantum networks with neutral atom processing nodes,

    J. P. Covey, H. Weinfurter, and H. Bernien, “Quantum networks with neutral atom processing nodes,” npj Quantum Information, vol. 9, no. 1, pp. 1–12, Sep. 2023, number: 1 Publisher: Nature Publishing Group. [Online]. Available: https://www.nature.com/articles/ s41534-023-00759-9

    work page 2023

  53. [55]

    An integrated quantum repeater at telecom wavelength with single atoms in optical fiber cavities,

    M. Uphoff, M. Brekenfeld, G. Rempe, and S. Ritter, “An integrated quantum repeater at telecom wavelength with single atoms in optical fiber cavities,” Applied Physics B, vol. 122, no. 3, Mar. 2016. [Online]. Available: http://dx.doi.org/10.1007/s00340-015-6299-2

    work page doi:10.1007/s00340-015-6299-2 2016

  54. [56]

    Measurement-induced entanglement for excitation stored in remote atomic en- sembles,

    C.W.Chou, H.deRiedmatten, D.Felinto, S.V.Polyakov, S. J. van Enk, and H. J. Kimble, “Measurement-induced entanglement for excitation stored in remote atomic en- sembles,”Nature, vol. 438, no. 7069, pp. 828–832, Dec. 2005

    work page 2005

  55. [57]

    Functional quantum nodes for entanglement distribution over scalable quantum networks,

    C. W. Chou, J. Laurat, H. Deng, K. S. Choi, H. de Riedmatten, D. Felinto, and H. J. Kimble, “Functional quantum nodes for entanglement distribution over scalable quantum networks,”Science, vol. 316, no. 5829, pp. 1316–1320, Jun. 2007. [Online]. Available: https://doi.org/10.1126%2Fscience.1140300

    work page 2007

  56. [58]

    Verifiable blind quantum computing with trapped ions and single photons,

    P. Drmota, D. Nadlinger, D. Main, B. Nichol, E. Ainley, D. Leichtle, A. Mantri, E. Kashefi, R. Srinivas, G. Araneda, C. Ballance, and D. Lucas, “Verifiable blind quantum computing with trapped ions and single photons,”Physical Review Letters, vol. 132, no. 15, Apr. 2024. [Online]. Available: http://dx.doi.org/10. 1103/PhysRevLett.132.150604

    work page 2024

  57. [59]

    Deployed measurement-device independent quantum key distribution and bell-state measurements coexisting with standard internet data and networking equipment,

    R. C. Berrevoets, T. Middelburg, R. F. L. Vermeulen, L. D. Chiesa, F. Broggi, S. Piciaccia, R. Pluis, P. Umesh, J. F. Marques, W. Tittel, and J. A. Slater, “Deployed measurement-device independent quantum key distribution and bell-state measurements coexisting with standard internet data and networking equipment,”Com- munications Physics, vol. 5, no. 1, p...

    work page doi:10.1038/s42005-022-00964-6 2022

  58. [60]

    On the Stochastic Analysis of a Quantum Entanglement Distribu- tion Switch,

    G. Vardoyan, S. Guha, P. Nain, and D. Towsley, “On the Stochastic Analysis of a Quantum Entanglement Distribu- tion Switch,”IEEE Transactions on Quantum Engineer- ing, vol. 2, pp. 1–16, 2021

    work page 2021

  59. [61]

    On the exact analysis of an idealized quantum switch,

    ——, “On the exact analysis of an idealized quantum switch,”Performance Evaluation, vol. 144, p. 102141, 2020

    work page 2020

  60. [62]

    On the capacity region of a quantum switch with en- tanglement purification,

    N. K. Panigrahy, T. Vasantam, D. Towsley, and L. Tassiu- las, “On the capacity region of a quantum switch with en- tanglement purification,” inIEEE INFOCOM 2023-IEEE Conference on Computer Communications. IEEE, 2023, pp. 1–10

    work page 2023

  61. [63]

    An architec- ture for control of entanglement generation switches in quantum networks,

    S. Gauthier, G. Vardoyan, and S. Wehner, “An architec- ture for control of entanglement generation switches in quantum networks,”IEEE Transactions on Quantum En- gineering, vol. 4, pp. 1–17, 2023

    work page 2023

  62. [64]

    An on-demand resource allocation algorithm for a quantum network hub and its performance analysis

    S. Gauthier, T. Vasantam, and G. Vardoyan, “An on-demand resource allocation algorithm for a quantum network hub and its performance analysis,” 2024. [Online]. Available: https://arxiv.org/abs/2405.18066

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  63. [65]

    Long- distance quantum communication with atomic ensembles and linear optics,

    L.-M. Duan, M. D. Lukin, J. I. Cirac, and P. Zoller, “Long- distance quantum communication with atomic ensembles and linear optics,”Nature, vol. 414, no. 6862, pp. 413–418, Nov. 2001

    work page 2001

  64. [66]

    Quantum Repeaters with Pho- ton Pair Sources and Multimode Memories,

    C. Simon, H. de Riedmatten, M. Afzelius, N. Sangouard, H. Zbinden, and N. Gisin, “Quantum Repeaters with Pho- ton Pair Sources and Multimode Memories,”Phys. Rev. Lett., vol. 98, p. 190503, May 2007

    work page 2007

  65. [67]

    Quantum repeaters based on atomic ensembles and linear optics,

    N. Sangouard, C. Simon, H. de Riedmatten, and N. Gisin, “Quantum repeaters based on atomic ensembles and linear optics,”Rev. Mod. Phys., vol. 83, pp. 33–80, Mar 2011

    work page 2011

  66. [68]

    Quantum repeaters based on single trapped ions,

    N. Sangouard, R. Dubessy, and C. Simon, “Quantum repeaters based on single trapped ions,”Phys. Rev. A, vol. 79, p. 042340, Apr 2009

    work page 2009

  67. [69]

    Interfacing atomic ensemble repeaters and ion trap nodes for intercity quantum networks,

    S. Maiti, G. Avis, S. Kar, and S. Wehner, “Interfacing atomic ensemble repeaters and ion trap nodes for intercity quantum networks,”In preparation and private communi- cation, 2024

    work page 2024

  68. [70]

    Exact rate analysis for quantum repeaters with imperfect memoriesandentanglementswappingassoonaspossible

    L. Kamin, E. Shchukin, F. Schmidt, and P. van Loock, “Exact rate analysis for quantum repeaters with imperfect memoriesandentanglementswappingassoonaspossible.” [Online]. Available: http://arxiv.org/abs/2203.10318

    work page arXiv

  69. [71]

    Osi reference model - the iso model of architecture for open systems interconnection,

    H. Zimmermann, “Osi reference model - the iso model of architecture for open systems interconnection,”IEEE Transactions on Communications, vol. 28, no. 4, pp. 425– 432, 1980

    work page 1980

  70. [72]

    Design and demonstration of an operating system for executing applications on quantum network nodes,

    C. D. Donne, M. Iuliano, B. van der Vecht, G. M. Ferreira, H. Jirovská, T. van der Steenhoven, A. Dahlberg, M. Skrzypczyk, D. Fioretto, M. Teller, P. Filippov, A. R.- P. Montblanch, J. Fischer, B. van Ommen, N. Demetriou, D. Leichtle, L. Music, H. Ollivier, I. t. Raa, W. Kozlowski, T. Taminiau, P. Pawełczak, T. Northup, R. Hanson, and S. Wehner, “Design a...

    work page arXiv 2024

  71. [73]

    Heralded entan- glement between solid-state qubits separated by three me- tres,

    H. Bernien, B. Hensen, W. Pfaff, G. Koolstra, M. S. Blok, L. Robledo, T. H. Taminiau, M. Markham, D. J. Twitchen, L. Childress, and R. Hanson, “Heralded entan- glement between solid-state qubits separated by three me- tres,”Nature, vol. 497, no. 7447, pp. 86–90, Apr. 2013

    work page 2013

  72. [74]

    Deterministic delivery of remote entanglement on a quantum network

    P. C. Humphreys, N. Kalb, J. P. J. Morits, R. N. Schouten, R. F. L. Vermeulen, D. J. Twitchen, M. Markham, and R. Hanson, “Deterministic delivery of remote entanglement on a quantum network,” Nature, vol. 558, no. 7709, pp. 268–273, Jun. 2018, arXiv:1712.07567 [quant-ph]. [Online]. Available: http: //arxiv.org/abs/1712.07567 24

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  73. [75]

    Entangling sin- gle atoms over 33 km telecom fibre,

    T. van Leent, M. Bock, F. Fertig, R. Garthoff, S. Eppelt, Y. Zhou, P. Malik, M. Seubert, T. Bauer, W. Rosenfeld, W. Zhang, C. Becher, and H. Weinfurter, “Entangling sin- gle atoms over 33 km telecom fibre,”Nature, vol. 607, no. 7917, pp. 69–73, Jul. 2022

    work page 2022

  74. [76]

    Operating system profiling via latency anal- ysis,

    N. Joukov, A. Traeger, R. Iyer, C. P. Wright, and E. Zadok, “Operating system profiling via latency anal- ysis,” inProceedings of the 7th Symposium on Operating Systems Design and Implementation, ser.OSDI’06. USA: USENIX Association, 2006, p. 89–102

    work page 2006

  75. [77]

    A. S. Tanenbaum, Modern Operating Systems, 2nd ed. Upper Saddle River, NJ, USA: Prentice Hall PTR, 2001

    work page 2001

  76. [78]

    G. C. Buttazzo, Hard Real-Time Computing Sys- tems: Predictable Scheduling Algorithms and Applications, 3rd ed. New York, NY, USA: Springer Science + Business Media, 2011

    work page 2011

  77. [79]

    Fundamental design issues for the future In- ternet,

    S. Shenker, “Fundamental design issues for the future In- ternet,”IEEE Journal on Selected Areas in Communica- tions, vol. 13, no. 7, pp. 1176–1188, Sep. 1995, conference Name: IEEE Journal on Selected Areas in Communica- tions

    work page 1995

  78. [80]

    Unconditional quantum teleportation.Science, 282(5389):706–709, 1998

    A. Furusawa, J. L. Sørensen, S. L. Braunstein, C. A. Fuchs, H. J. Kimble, and E. S. Polzik, “Unconditional quantum teleportation,”Science, vol. 282, no. 5389, pp. 706–709, 1998. [Online]. Available: https: //www.science.org/doi/abs/10.1126/science.282.5389.706

    work page doi:10.1126/science.282.5389.706 1998

  79. [81]

    Deterministic quantum telepor- tation of atomic qubits,

    M.D.Barrett, J.Chiaverini, T.Schaetz, J.Britton, W.M. Itano, J. D. Jost, E. Knill, C. Langer, D. Leibfried, R. Oz- eri, and D. J. Wineland, “Deterministic quantum telepor- tation of atomic qubits,”Nature, vol. 429, pp. 737–739, 2004

    work page 2004

  80. [82]

    Verifying BQP Computations on Noisy Devices with Minimal Overhead,

    D. Leichtle, L. Music, E. Kashefi, and H. Ollivier, “Verifying BQP Computations on Noisy Devices with Minimal Overhead,” Sep. 2021, arXiv:2109.04042 [quant- ph]. [Online]. Available: http://arxiv.org/abs/2109.04042

    work page arXiv 2021

Showing first 80 references.