Centralizing Task-based Approach to Quantum Network Control

• URL: http://arxiv.org/abs/2605.03336v1
• Date: Tue, 05 May 2026 03:57:17 GMT
• Title: Centralizing Task-based Approach to Quantum Network Control
• Abstract summary: layered architectures impose stringent design and timing constraints on quantum networks.<n>We simulate a resource-centric, task-based approach to quantum network control by utilizing a centralized controller.
• Score: 71.48385446560893
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• A Framework for Distributed Resource Allocation in Quantum Networks [8.76473628143937]
  We introduce a distributed resource allocation framework for the Quantum Internet that relies on fully decentralized coordination to serve co-existing applications.<n>We develop quantum network control algorithms under the mathematical framework of Quantum Network Utility Maximization (QNUM)<n>We then introduce QPrimal-Dual, a decentralized, scalable algorithm that solves QNUM by placing network controllers that operate using local state information.
  arXiv  Detail & Related papers  (2025-10-10T13:27:32Z)
• Dynamic Scheduling in Fiber and Spaceborne Quantum Repeater Networks [0.0]
  We present a framework to mathematically formulate the scheduling problem over quantum networks.<n>By leveraging the framework, we apply Lyapunov drift minimization to derive a novel class of quadratic optimization based scheduling policies.<n>We also report on the development of numerous extensions to QuISP, an established quantum network simulator.
  arXiv  Detail & Related papers  (2025-10-07T12:23:46Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Entanglement Request Scheduling in Quantum Networks Using Deep Q-Network [3.1856756516735936]
  A novel Deep Q-Network (DQN) based scheduling method is proposed to optimize delay time and fairness among entanglement requests in quantum repeater networks.<n>Results show that the proposed technique achieves higher performance compared to Greedy, Proportional fair and FIFO scheduling schemes.
  arXiv  Detail & Related papers  (2025-05-18T15:32:21Z)
• A Control Architecture for Entanglement Generation Switches in Quantum Networks [1.0282274843007797]
  Entanglement between quantum network nodes is often produced using intermediary devices - such as heralding stations - as a resource. Here, we propose a cost-effective architecture to connect many quantum network nodes via a central quantum network hub called an Entanglement Generation Switch (EGS) The EGS allows multiple quantum nodes to be connected at a fixed resource cost, by sharing the resources needed to make entanglement.
  arXiv  Detail & Related papers  (2023-09-05T10:06:48Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
  Quantum networks rely on entanglement between qubits at distant nodes to transmit information. We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links. We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
  arXiv  Detail & Related papers  (2022-12-17T05:40:09Z)
• A Quantum Overlay Network for Efficient Entanglement Distribution [15.034732044326752]
  We introduce Quantum Overlay Networks (QONs) for efficient entanglement distribution in quantum networks. When the demand to create end-to-end user entanglements is low, QONs can generate and store maximally entangled Bell pairs. We show that QONs fare well by a factor of 40% with respect to meeting surge and changing demands compared to traditional non-overlay proposals.
  arXiv  Detail & Related papers  (2022-12-03T21:20:30Z)
• Semi-supervised Network Embedding with Differentiable Deep Quantisation [81.49184987430333]
  We develop d-SNEQ, a differentiable quantisation method for network embedding. d-SNEQ incorporates a rank loss to equip the learned quantisation codes with rich high-order information. It is able to substantially compress the size of trained embeddings, thus reducing storage footprint and accelerating retrieval speed.
  arXiv  Detail & Related papers  (2021-08-20T11:53:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.