It is shown that the best-performing compilation strategy varies across the tested circuits and network configurations, and that both network topology and intra-QPU connectivity substantially affect the entanglement cost of execution.
Abstract
Distributed quantum computing (DQC) seeks to scale beyond the limits of monolithic processors by interconnecting multiple quantum processing units (QPUs) through entanglement-based links. Realizing this vision requires the co-design of hardware and software across the domains of quantum networking, compilation, and scheduling, yet existing tools remain fragmented between monolithic circuit compilers and long-distance quantum network simulators. We present an open-source, topology-informed framework for the compilation and scheduling of distributed quantum programs. Given an input circuit and a description of the target network, the framework partitions and reconstructs the circuit into a distributed program that respects the specified inter- and intra-QPU topology, covers cross-QPU operations through gate and state teleportation, and schedules the result under either deterministic or stochastic entanglement-generation models. By accepting and emitting standard OpenQASM, the framework interoperates with existing monolithic toolchains, and its standardized module interfaces allow partitioning and scheduling strategies to be interchanged and benchmarked. Using this framework, we show that the best-performing compilation strategy varies across the tested circuits and network configurations, and that both network topology and intra-QPU connectivity substantially affect the entanglement cost of execution. These findings underscore the need for a co-design approach to distributed quantum computing, which our framework is designed to support.
It is demonstrated that traditional communication metrics are insufficient predictors of execution quality due to the strong interaction among path fidelity, hardware characteristics, and circuit structure, and a topology-aware fidelity proxy (TAFP) evaluation approach that approximates distributed execution fidelity i...
Yeong Lim Tan, Sen Zhang, Haneen Alfauri et al.· Proceedings of the 3rd ACM S...· 0 citations
Distributed Quantum Computing (DQC) is essential for scaling quantum algorithms beyond monolithic constraints, yet current software ecosystems require tedious manual orchestration of low-level physical resources. This paper presents NetQMPI, a high-level Python framework that adapts the Message Passing Interface (MPI)...
F. J. Cardama, Jorge Vázquez-Pérez, Tomás F. Pena et al.· IEEE Access· 1 citation
The realization of practical quantum advantage requires executing large-scale circuits that far exceed the qubit capacity of any single quantum processor. To address this, two primary scaling strategies have emerged: circuit cutting, which utilizes classical resources to decompose circuits into smaller fragments, and m...
Ze-Fan Du, Wen-Rui Zhang, Jake Gesseck et al.· IEEE International Conferenc...· 0 citations
A quantum network architecture based on the Beneš switching topology that provides a universal switching framework for pairwise communications and is compatible in principle with quantum platforms supporting these capabilities is proposed.
Shu-Ming Hu, Jun-Hao Wei, Nuo-Ya Yang et al.· Chinese Physics B· 0 citations
DPRQ is proposed, a qubit routing algorithm for minimizing inter-node communication in distributed quantum circuits divided into collective communication blocks that employs a dynamic programming-based technique focused on global circuit-level optimization, while capturing inter-block dependencies.
Dhaval Vaidya, Ruozhou Yu· Proceedings of the 3rd ACM S...· 0 citations
Distributed quantum computing (DQC) has been proposed as a way to scale quantum algorithms for practical applications beyond monolithic quantum processor architectures. Among these applications, quantum chemistry is widely regarded as one of the most promising use cases for quantum computing. In this work, we estimate...
G. Jones, Hassan Tariq Shafi, Zi-Xuan Wang et al.· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comNov 12, 2026
What's new in research at Microsoft? Host Anson Ho explores the latest, including AI-powered universal translation, a breakthrough in a 31-year-old mathematics challenge, and advances making AI coding agents faster and more efficient. The post Microsoft Research Focus – Edition #98 appeared first on Microsoft Research.
AI agents can generate code at a scale that’s hard for humans to review line-by-line. PDD Kit helps ensure the code is doing what the developer intended by creating formal specifications and testing against them. It converts developer intent into a Verus specification, proves AI-generated code meets it for every input, and uses tests where proofs aren't practical. Developers review intent, not every line. The post Formally verifying agent-written full-stack web apps with PDD Kit appeared first o…