EPR计数用于分布式量子计算中的运行时间预测
EPR Count for Runtime Prediction in Distributed Quantum Computing
浏览论文内容
中文总结 AI 辅助
本研究系统评估分布式量子计算中EPR计数与运行时间的关系，发现EPR成本相同但执行时间差异大，最小EPR映射可能非最优，需显式通信感知建模。
中文摘要 AI 辅助
EPR对的消耗通常被用作分布式量子计算中的通信成本目标，但最小化EPR成本并不一定最小化分布式执行时间。尽管其被广泛使用，EPR计数作为运行时间代理的可靠性在不同工作负载和通信条件下的直接表征仍然有限。本研究通过系统评估QFT、QAOA和CDKM电路在所有平衡双QPU映射下EPR成本与运行时间之间的关系，填补了这一空白。结果表明，具有相同EPR成本的映射可能具有显著不同的执行时间，较低EPR的映射可能更慢，且最小EPR映射可能并非运行时间最优。EPR计数的可靠性强烈依赖于工作负载，并随通信运行机制而变化：增加EPR生成延迟会放大由相同EPR成本隐藏的运行时间差异，而增加通信并发性可能降低EPR计数保持运行时间排序的能力。这些结果表明，EPR计数和执行时间是相关但不同的优化目标，并识别了需要显式通信感知运行时间建模的机制。
英文摘要
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.
发表机构
- University of Cambridge（剑桥大学）
- Koç University（科奇大学）
机构由 AI 辅助整理，请以论文原文为准。
