Metraipolis › archive › dc_bdb88aaa99f0
Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms — arXiv:2608.27099
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.27099
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T15:28:28.629Z
- SHA-256 of the archived text
1ec40236a490633445b6c9c5f52f6f72d35cab847cc16cf99a04053d51d52003- Stable URL of this page
https://metraipolis.com/documento/dc_bdb88aaa99f0
How to cite
Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms — arXiv:2608.27099 — arXiv (en), https://arxiv.org/abs/2608.27099 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bdb88aaa99f0 (Metraipolis archive dc_bdb88aaa99f0, sha256 1ec40236a490633445b6c9c5f52f6f72d35cab847cc16cf99a04053d51d52003)
BibTeX
@misc{dcbdb88aaa99f0,
title = {Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms — arXiv:2608.27099},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.27099},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bdb88aaa99f0; sha256 1ec40236a490633445b6c9c5f52f6f72d35cab847cc16cf99a04053d51d52003},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27099. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-28 in cs.DC). Categorie arXiv: Quantum Physics (quant-ph) ; Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2608.27099 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T15:17:44.906Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).