Entanglement Request Scheduling in Quantum Networks Using Deep Q-Network

• URL: http://arxiv.org/abs/2505.12461v1
• Date: Sun, 18 May 2025 15:32:21 GMT
• Title: Entanglement Request Scheduling in Quantum Networks Using Deep Q-Network
• Authors: Gongyu Ni, Lester Ho, Holger Claussen,
• Abstract summary: 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.
• Score: 3.1856756516735936
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, a novel Deep Q-Network (DQN) based scheduling method to optimize delay time and fairness among entanglement requests in quantum repeater networks is proposed. The scheduling of requests determines which pairs of end nodes should be entangled during the current time slot, while other pairs are placed in a queue for future slots. However, existing research on quantum networking often relies on simple statistical models to capture the behavior of quantum hardware, such as the failure rate of establishing entanglement. Moreover, current quantum simulators do not support network behaviors, including handling, pending, and dropping requests. To bridge the gap between quantum deployments and network behaviors, in this paper a dynamic network model is presented, encompassing quantum simulations, random topologies, and user modeling. The DQN based scheduling scheme allows us to balance the conflicting objectives of minimizing delay time and maximizing fairness among these entanglement requests. The proposed technique was evaluated using simulations, with results showing that the proposed DQN achieves higher performance compared to Greedy, Proportional fair and FIFO scheduling schemes.

Related papers

• A Design for an Early Quantum Network [16.672561002587486]
  We propose a design for early-stage quantum networks that is compatible with the three existing quantum repeater technologies.<n>The design aims to maximize the ability of the network to accommodate the diverse needs of quantum applications.
  arXiv  Detail & Related papers  (2025-08-07T01:39:49Z)
• Network-Aware Scheduling for Remote Gate Execution in Quantum Data Centers [8.528068737844364]
  We evaluate two entanglement scheduling strategies-static and dynamic-and analyze their performance.<n>We show that dynamic scheduling consistently outperforms static scheduling in scenarios with high entanglement parallelism.
  arXiv  Detail & Related papers  (2025-04-28T18:22:22Z)
• Optimized Generation of Entanglement by Real-Time Ordering of Swapping Operations [4.152766500389854]
  Long-distance quantum communication in quantum networks faces significant challenges due to the constraints imposed by the no-cloning theorem. Most existing quantum communication protocols rely on the a priori distribution of entanglement pairs (EPs) We present a greedy algorithm that iteratively determines the best route and/or entanglement-swapping operation to perform at each stage based on the current network.
  arXiv  Detail & Related papers  (2024-05-13T06:43:11Z)
• Learning to Program Variational Quantum Circuits with Fast Weights [3.6881738506505988]
  This paper introduces the Quantum Fast Weight Programmers (QFWP) as a solution to the temporal or sequential learning challenge. The proposed QFWP model achieves learning of temporal dependencies without necessitating the use of quantum recurrent neural networks. Numerical simulations conducted in this study showcase the efficacy of the proposed QFWP model in both time-series prediction and RL tasks.
  arXiv  Detail & Related papers  (2024-02-27T18:53:18Z)
• 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)
• Matching Game for Optimized Association in Quantum Communication Networks [65.16483325184237]
  This paper proposes a swap-stable request-QS association algorithm for quantum switches. It achieves a near-optimal (within 5%) performance in terms of the percentage of served requests. It is shown to be scalable and maintain its near-optimal performance even when the size of the QCN increases.
  arXiv  Detail & Related papers  (2023-05-22T03:39:18Z)
• 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)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• ESDI: Entanglement Scheduling and Distribution in the Quantum Internet [4.558581187459857]
  Quantum entanglement distribution between remote nodes is key to many promising quantum applications. This paper considers entanglement scheduling and distribution among many source-destination pairs with different requests over an entire quantum network topology. Inspired by optimal scheduling disciplines in conventional single-queue scenarios, we design a general optimization framework for entanglement scheduling and distribution called ESDI.
  arXiv  Detail & Related papers  (2023-03-30T17:09:59Z)
• 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)
• Better than the Best: Gradient-based Improper Reinforcement Learning for Network Scheduling [60.48359567964899]
  We consider the problem of scheduling in constrained queueing networks with a view to minimizing packet delay. We use a policy gradient based reinforcement learning algorithm that produces a scheduler that performs better than the available atomic policies.
  arXiv  Detail & Related papers  (2021-05-01T10:18:34Z)

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.