EPR Count for Runtime Prediction in Distributed Quantum Computing
This work investigates whether minimizing entanglement resource cost (EPR count) also minimizes distributed quantum computing execution time. The study tested various circuit types like QFT and QAOA across different mappings, finding that lower EPR cost does not guarantee faster runtime. It concludes that EPR count is workload-dependent and its reliability changes based on communication speed.