Dynamic Distribution of Quantum Circuits with Minimum Circuit-Execution Time
Ranjani G. Sundaram, Himanshu Gupta · 2025
Distribution of quantum circuits (DQC) is a promising strategy to enable large-scale quantum computations by utilizing a network of quantum computers. However, executing distributed quantum programs entails generating entanglements (to execute remote gates), which can incur significant latency and lead to qubits’ decoherence. Prior works on the problem of distributing quantum circuits with minimum circuit-execution time have only considered a static allocation of qubits to network nodes, presumably for simplicity. In this work, we show that distributing quantum circuits with a dynamic allocation of qubits, i.e., qubit allocation (over the quantum computers) that changes during the circuit execution, can lower circuit execution time. For this DQC problem wherein qubit allocation can be dynamic (i.e., change over time), we design efficient algorithms and demonstrate the effectiveness of designed techniques via extensive simulations over NetSquid, a quantum network simulator; our techniques outperform the best prior work (using static qubit allocation) by up to 50%.