Resource Management for Distributed Quantum Computing in Quantum Data Centers
In recent years, advances in quantum computing have been driven by substantial improvements in both the number and quality of qubits. As the field progresses, there is growing interest in interconnecting quantum systems to enable scalable computation through Distributed Quantum Computing (DQC) architectures. Consider a distributed quantum application executed across multiple Quantum Processing Units (QPUs) within a quantum data center, where remote gates require establishing entanglement between different QPUs. The creation of such end-to-end entanglement can lead to network congestion and resource contention. To address these challenges, we propose a resource management framework that maximizes fidelity-guaranteed throughput while satisfying dependency constraints. We first formulate the problem as a Mixed-Integer Linear Programming (MILP) model to provide a performance benchmark. Building on this, we develop efficient approximate scheduling algorithms that achieve performance comparable to the optimization solver. Although a trade-off exists between execution time and network throughput, simulation results demonstrate that one of the proposed strategies, Weighted Group Least Resource First (WGLRF), closely approximates the solver’s performance across most scenarios. These findings suggest that the lightweight strategy is sufficient for current DQC settings, offering a practical solution for managing remote-gate resource contention in distributed quantum circuits and improving overall system performance.