EPR Count for Runtime Prediction in Distributed Quantum Computing
Abstract
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.
Related
- Transpilation-Aware Runtime Prediction for Noisy Quantum Circuit Simulation
- SeQUeNCe.DQC: Full-stack Simulation of Distributed Quantum Computing
- Feasibility of Distributed Fault-Tolerant Quantum Computing: From Quantum Links to Algorithms
- Distributed variational quantum computing with deterministic entanglement tuning
- Transversal Fanout for Fault Tolerant Distributed Quantum Computing: Analysis and Application
BibTeX
@misc{bilgen2026count,
title = {{EPR Count for Runtime Prediction in Distributed Quantum Computing}},
author = {Fatih E. Bilgen and Ozgur B. Akan},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.39851},
eprint = {2609.39851},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39851},
}
RIS
TY - UNPB
TI - EPR Count for Runtime Prediction in Distributed Quantum Computing
AU - Fatih E. Bilgen
AU - Ozgur B. Akan
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.39851
UR - https://arxiv.org/abs/2609.39851
AB - 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.
ER -