Metraipolis › archive › dc_e766487e44fe

EPR Count for Runtime Prediction in Distributed Quantum Computing — arXiv:2609.39851

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39851
License (as archived)
CC0-1.0
Archived
2026-10-07T13:14:56.823Z
SHA-256 of the archived text
544f022ed2076acf3c91620a928b222056982770272ac684b4eb44f88dff01ec
Stable URL of this page
https://metraipolis.com/documento/dc_e766487e44fe

How to cite

EPR Count for Runtime Prediction in Distributed Quantum Computing — arXiv:2609.39851 — arXiv (en), https://arxiv.org/abs/2609.39851 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e766487e44fe (Metraipolis archive dc_e766487e44fe, sha256 544f022ed2076acf3c91620a928b222056982770272ac684b4eb44f88dff01ec)
BibTeX
@misc{dce766487e44fe,
  title = {EPR Count for Runtime Prediction in Distributed Quantum Computing — arXiv:2609.39851},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39851},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e766487e44fe; sha256 544f022ed2076acf3c91620a928b222056982770272ac684b4eb44f88dff01ec},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39851. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

EPR-pair consumption is commonly used as a communication-cost objective in distributed quantum computing, but minimizing EPR cost does not necessarily minimize distributed execution time. Despite its widespread use, the reliability of EPR count as a runtime surrogate has received limited direct characterization across different workloads and communication conditions. This work addresses this gap by systematically evaluating the relationship between EPR cost and runtime over all balanced two-QPU mappings of QFT, QAOA, and CDKM circuits. The results show that mappings with identical EPR cost can have substantially different execution times, lower-EPR mappings can be slower, and minimum-EPR mappings can be runtime-suboptimal. The reliability of EPR count is strongly workload dependent and also changes with the communication operating regime: increasing EPR-generation latency amplifies runtime differences hidden by equal EPR cost, while increased communication concurrency can reduce the ability of EPR count to preserve runtime ordering. These results show that EPR count and execution time are related but distinct optimization objectives, and identify regimes in which explicit communication-aware runtime modeling is necessary.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-10-01 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.39851 — 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-07T12:46:39.736Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).