Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.12675 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918515040059392 |
|---|---|
| author | Bahrani, Sima Oliveira, Romerson D. Parra-Ullauri, Juan Marcelo Wang, Rui Simeonidou, Dimitra |
| author_facet | Bahrani, Sima Oliveira, Romerson D. Parra-Ullauri, Juan Marcelo Wang, Rui Simeonidou, Dimitra |
| contents | Distributed quantum computing (DQC) has emerged as a promising approach to overcome the scalability limitations of monolithic quantum processors in terms of computational capability. However, realising the full potential of DQC requires effective resource management and circuit scheduling. This involves efficiently assigning each circuit to a subset of quantum processing units (QPUs), based on factors such as their computational power and connectivity. In heterogeneous DQC networks with arbitrary connectivity topologies and non-identical QPUs, this becomes a complex challenge. This paper addresses resource management and circuit scheduling in such settings, with a focus on computing resource allocation in a quantum data center. We propose circuit scheduling algorithms based on Mixed-Integer Linear Programming (MILP). Our MILP model accounts for errors arising from inter-QPU communication. In particular, the proposed schemes consider key factors, including network topology, QPU capacities, and quantum circuit structure, to make efficient scheduling and allocation decisions. Simulation results demonstrate that our proposed algorithms significantly improve circuit execution time and scheduling efficiency (measured by makespan and throughput), while also reducing inter-QPU communication overhead, compared to baseline strategies. This work provides valuable insights into resource management strategies for scalable and heterogeneous DQC systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_12675 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Resource Management and Circuit Scheduling for Distributed Quantum Computing Interconnect Networks Bahrani, Sima Oliveira, Romerson D. Parra-Ullauri, Juan Marcelo Wang, Rui Simeonidou, Dimitra Quantum Physics Distributed quantum computing (DQC) has emerged as a promising approach to overcome the scalability limitations of monolithic quantum processors in terms of computational capability. However, realising the full potential of DQC requires effective resource management and circuit scheduling. This involves efficiently assigning each circuit to a subset of quantum processing units (QPUs), based on factors such as their computational power and connectivity. In heterogeneous DQC networks with arbitrary connectivity topologies and non-identical QPUs, this becomes a complex challenge. This paper addresses resource management and circuit scheduling in such settings, with a focus on computing resource allocation in a quantum data center. We propose circuit scheduling algorithms based on Mixed-Integer Linear Programming (MILP). Our MILP model accounts for errors arising from inter-QPU communication. In particular, the proposed schemes consider key factors, including network topology, QPU capacities, and quantum circuit structure, to make efficient scheduling and allocation decisions. Simulation results demonstrate that our proposed algorithms significantly improve circuit execution time and scheduling efficiency (measured by makespan and throughput), while also reducing inter-QPU communication overhead, compared to baseline strategies. This work provides valuable insights into resource management strategies for scalable and heterogeneous DQC systems. |
| title | Resource Management and Circuit Scheduling for Distributed Quantum Computing Interconnect Networks |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2409.12675 |