Network-Aware Scheduling for Remote Gate Execution in Quantum Data Centers

• URL: http://arxiv.org/abs/2504.20176v1
• Date: Mon, 28 Apr 2025 18:22:22 GMT
• Title: Network-Aware Scheduling for Remote Gate Execution in Quantum Data Centers
• Authors: Shahrooz Pouryousef, Reza Nejabati, Don Towsley, Ramana Kompella, Eneet Kaur,
• Abstract summary: 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.
• Score: 8.528068737844364
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Modular quantum computing provides a scalable approach to overcome the limitations of monolithic quantum architectures by interconnecting multiple Quantum Processing Units (QPUs) through a quantum network. In this work, we explore and evaluate two entanglement scheduling strategies-static and dynamic-and analyze their performance in terms of circuit execution delay and network resource utilization under realistic assumptions and practical limitations such as probabilistic entanglement generation, limited communication qubits, photonic switch reconfiguration delays, and topology-induced contention. We show that dynamic scheduling consistently outperforms static scheduling in scenarios with high entanglement parallelism, especially when network resources are scarce. Furthermore, we investigate the impact of communication qubit coherence time, modeled as a cutoff for holding EPR pairs, and demonstrate that aggressive lookahead strategies can degrade performance when coherence times are short, due to premature entanglement discarding and wasted resources. We also identify congestion-free BSM provisioning by profiling peak BSM usage per switch. Our results provide actionable insights for scheduler design and resource provisioning in realistic quantum data centers, bringing system-level considerations closer to practical quantum computing deployment.

Related papers

• 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)
• Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks [9.971549076128268]
  We explore two minimal asynchronous protocols for entanglement in quantum networks. A parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation.
  arXiv  Detail & Related papers  (2024-05-03T18:04:11Z)
• Compiler for Distributed Quantum Computing: a Reinforcement Learning Approach [6.347685922582191]
  We introduce a novel compiler that prioritizes reducing the expected execution time by jointly managing the generation and routing of EPR pairs. We present a real-time, adaptive approach to compiler design, accounting for the nature of entanglement generation and the operational demands of quantum circuits. Our contributions are twofold: (i) we model the optimal compiler for DQC using a Markov Decision Process (MDP) formulation, establishing the existence of an optimal algorithm, and (ii) we introduce a constrained Reinforcement Learning (RL) method to approximate this optimal compiler.
  arXiv  Detail & Related papers  (2024-04-25T23:03:20Z)
• 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)
• 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)
• Efficient Parallel Split Learning over Resource-constrained Wireless Edge Networks [44.37047471448793]
  In this paper, we advocate the integration of edge computing paradigm and parallel split learning (PSL) We propose an innovative PSL framework, namely, efficient parallel split learning (EPSL) to accelerate model training. We show that the proposed EPSL framework significantly decreases the training latency needed to achieve a target accuracy.
  arXiv  Detail & Related papers  (2023-03-26T16:09:48Z)
• DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization in Future Networks [54.03701670739067]
  We propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks. Based on the proposed approach, we discuss the potential applications for collaborative optimization in future networks, such as smart grid management, IoT cooperation, and UAV trajectory planning.
  arXiv  Detail & Related papers  (2022-09-16T02:44:52Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
  Self-Attention Mechanism (SAM) is good at capturing the internal connections of features. A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2022-07-14T12:22:51Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)

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.