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

• URL: http://arxiv.org/abs/2405.18066v1
• Date: Tue, 28 May 2024 11:25:32 GMT
• Title: An on-demand resource allocation algorithm for a quantum network hub and its performance analysis
• Authors: Scarlett Gauthier, Thirupathaiah Vasantam, Gayane Vardoyan,
• Abstract summary: We study traffic models for a type of quantum network hub called an Entanglement Generation Switch (EGS), a device that allocates resources to enable entanglement generation between nodes in response to user-generated demand. We propose an on-demand resource allocation algorithm, where a demand is either blocked if no resources are available or else results in immediate resource allocation. Our work is the first analysis of traffic characteristics at an EGS system and provides a valuable analytic tool for devising performance driven resource allocation algorithms.
• Score: 0.9148747049384086
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: To effectively support the execution of quantum network applications for multiple sets of user-controlled quantum nodes, a quantum network must efficiently allocate shared resources. We study traffic models for a type of quantum network hub called an Entanglement Generation Switch (EGS), a device that allocates resources to enable entanglement generation between nodes in response to user-generated demand. We propose an on-demand resource allocation algorithm, where a demand is either blocked if no resources are available or else results in immediate resource allocation. We model the EGS as an Erlang loss system, with demands corresponding to sessions whose arrival is modelled as a Poisson process. To reflect the operation of a practical quantum switch, our model captures scenarios where a resource is allocated for batches of entanglement generation attempts, possibly interleaved with calibration periods for the quantum network nodes. Calibration periods are necessary to correct against drifts or jumps in the physical parameters of a quantum node that occur on a timescale that is long compared to the duration of an attempt. We then derive a formula for the demand blocking probability under three different traffic scenarios using analytical methods from applied probability and queueing theory. We prove an insensitivity theorem which guarantees that the probability a demand is blocked only depends upon the mean duration of each entanglement generation attempt and calibration period, and is not sensitive to the underlying distributions of attempt and calibration period duration. We provide numerical results to support our analysis. Our work is the first analysis of traffic characteristics at an EGS system and provides a valuable analytic tool for devising performance driven resource allocation algorithms.

Related papers

• 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. We show that dynamic scheduling consistently outperforms static scheduling in scenarios with high entanglement parallelism.
  arXiv  Detail & Related papers  (2025-04-28T18:22:22Z)
• Service-the-Longest-Queue Among d Choices Policy for Quantum Entanglement Switching [0.9148747049384086]
  Entanglement Generation Switch (EGS) is a quantum network hub that provides entangled states to a set of connected nodes. We propose a load-balancing policy wherein the EGS queries nodes for entanglement requests by randomly sampling d of all available request queues. We observe a significant decrease in the average request processing time when the number of choices d increases.
  arXiv  Detail & Related papers  (2025-03-28T10:10:12Z)
• Optimal resource requirements for connected quantum sub-networks [1.619107149276392]
  This work describes a scalable approach for building large quantum networks by connecting quantum sub-networks. We derive a set of equations whose solutions give the optimal values of average network parameters that meet threshold requirements. Our results present a pathway for calculating optimal resource requirements in quantum sub-networks interconnected to form the global quantum internet.
  arXiv  Detail & Related papers  (2025-02-20T09:20:55Z)
• Resource Management and Circuit Scheduling for Distributed Quantum Computing Interconnect Networks [4.0985912998349345]
  Distributed quantum computing (DQC) has emerged as a promising approach to overcome the scalability limitations of monolithic quantum processors. This paper addresses the problem of resource allocation in such networks, focusing on computing resource management in a quantum farm setting. We propose a multi-objective optimisation algorithm for optimal QPU allocation that aims to minimise the degradation caused by inter-QPU communication latencies.
  arXiv  Detail & Related papers  (2024-09-19T11:39:46Z)
• Generative AI-enabled Quantum Computing Networks and Intelligent Resource Allocation [80.78352800340032]
  Quantum computing networks execute large-scale generative AI computation tasks and advanced quantum algorithms. efficient resource allocation in quantum computing networks is a critical challenge due to qubit variability and network complexity. We introduce state-of-the-art reinforcement learning (RL) algorithms, from generative learning to quantum machine learning for optimal quantum resource allocation.
  arXiv  Detail & Related papers  (2024-01-13T17:16:38Z)
• 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)
• Performance metrics for the continuous distribution of entanglement in multi-user quantum networks [0.0]
  Entangled states shared among distant nodes are frequently used in quantum network applications. In this paper, we focus on the steady-state performance analysis of protocols for continuous distribution of entanglement. One of the main conclusions from our analysis is that the entanglement consumption rate has a greater impact on the protocol performance than the fidelity requirements.
  arXiv  Detail & Related papers  (2023-07-03T23:55:02Z)
• 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)
• 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)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Resource Allocation via Graph Neural Networks in Free Space Optical Fronthaul Networks [119.81868223344173]
  This paper investigates the optimal resource allocation in free space optical (FSO) fronthaul networks. We consider the graph neural network (GNN) for the policy parameterization to exploit the FSO network structure. The primal-dual learning algorithm is developed to train the GNN in a model-free manner, where the knowledge of system models is not required.
  arXiv  Detail & Related papers  (2020-06-26T14:20:48Z)

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.