Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms
Abstract
Distributed Quantum Computing (DQC) addresses the physical scaling limitations of monolithic quantum processors by networking modular Quantum Processing Units (QPUs). Efficient execution of quantum algorithms on DQC architectures requires compiling them across QPUs while minimizing inter-QPU communication bottlenecks, primarily through circuit partitioning. However, current evaluations of state-of-the-art partitioning heuristics focus primarily on the total entanglement cost of the partitions, failing to capture the broader structural and temporal overheads introduced by distributed network constraints. This paper addresses this evaluation gap by applying established monolithic benchmarking metrics to partitioned distributed circuits to quantify the performance impact of network constraints. Using an open-source, automated evaluation pipeline, we systematically assess diverse partitioning algorithms across standardized workloads and quantum network topologies. Our empirical results reveal that partitioning algorithms with comparable entanglement costs can still introduce drastically different physical execution penalties. By exposing these hidden trade-offs, such as severe increases in circuit depth and substantial reductions in gate density, this study demonstrates that comprehensive circuit-level metrics are essential for guiding the future design of DQC compilers.
Related
- Tight Communication Bounds for Distributed Algorithms in the Quantum Routing Model
- Feasibility of Distributed Fault-Tolerant Quantum Computing: From Quantum Links to Algorithms
- Few-Electron Partitioning in the Fractional Quantum Hall Regime
- Mid-Atlantic US observations of radiocarbon in CO 2 : fossil and biogenic source partitioning and model evaluation
- Entanglement-Aware Quantum Circuit Optimization through Globally Optimal Partitioning
BibTeX
@misc{velatambo2026towards,
title = {{Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms}},
author = {Javier Vela-Tambo and Davud Azizov and Tian Guo},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2608.27099},
eprint = {2608.27099},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.27099},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms
AU - Javier Vela-Tambo
AU - Davud Azizov
AU - Tian Guo
PY - 2026
DA - 2026/09/09
PB - arXiv
DO - 10.48550/arxiv.2608.27099
UR - https://arxiv.org/abs/2608.27099
AB - Distributed Quantum Computing (DQC) addresses the physical scaling limitations of monolithic quantum processors by networking modular Quantum Processing Units (QPUs). Efficient execution of quantum algorithms on DQC architectures requires compiling them across QPUs while minimizing inter-QPU communication bottlenecks, primarily through circuit partitioning. However, current evaluations of state-of-the-art partitioning heuristics focus primarily on the total entanglement cost of the partitions, failing to capture the broader structural and temporal overheads introduced by distributed network constraints. This paper addresses this evaluation gap by applying established monolithic benchmarking metrics to partitioned distributed circuits to quantify the performance impact of network constraints. Using an open-source, automated evaluation pipeline, we systematically assess diverse partitioning algorithms across standardized workloads and quantum network topologies. Our empirical results reveal that partitioning algorithms with comparable entanglement costs can still introduce drastically different physical execution penalties. By exposing these hidden trade-offs, such as severe increases in circuit depth and substantial reductions in gate density, this study demonstrates that comprehensive circuit-level metrics are essential for guiding the future design of DQC compilers.
ER -