Dependency-Aware Circuit Scheduling for Multi-Core Quantum Systems to Minimize Makespan

Abstract

Multi-core quantum computing architectures have emerged as a promising solution to the qubit scalability limitations of monolithic NISQ devices. Quantum algorithms are expressed as quantum circuits composed of single- and two-qubit gates. However, circuit scheduling in multi-core quantum systems remains largely unexplored. Reducing overall execution time (makespan), increasing core utilization, and hiding communication latency behind computation depends on effective scheduling. In this paper, we first introduce a layered scheduling approach as a baseline where quantum gates within the same layer are executed in parallel, while layers themselves are executed sequentially. We then propose a greedy scheduling strategy which schedules each gate as soon as all its dependencies and required resources are available. This allows fine-grained parallelism across cores. Our evaluation shows that on real benchmarks, greedy scheduling achieves an average 40% reduction in makespan and improvement in core utilization. The results suggest that the use of intelligent circuit scheduling to exploit parallelism can greatly enhance the speed of circuit execution in multi-core quantum architectures.

References in corpus (6)

• Quantum Computing in the NISQ era and beyond
• MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
• A Modular Quantum Compilation Framework for Distributed Quantum Computing
• Mapping quantum circuits to modular architectures with QUBO
• Interconnect Fabrics for Multi-Core Quantum Processors: A Context Analysis
• TeleSABRE: Layout Synthesis in Multi-Core Quantum Systems with Teleport Interconnect