Answers are grounded in this paper and cite their sources.
In Distributed Quantum Computing (DQC), reliable entanglement distribution across a network of quantum computers is crucial. During the quantum program compilation process, the timing and locations of required entanglement resources can be determined. Leveraging this information, we use the properties of quantum network hardware-specifically, the entanglement generation and quantum switch operation rates-to optimize quantum job execution schedules. This work presents a system that, given a set of quantum programs, extracts an Entaglement Demand Schedule (EDS) and generates an execution plan, including resource allocation tables and switch control instructions. We outline the system architecture and benchmark its performance using collections of randomized quantum programs, and describe further steps to enhance our system.
No takes yet. Share an insight, caveat, or question.
Vista et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: