Proposes system-aware allocation for distributed quantum workflows via modified graph algorithms on hybrid classical-quantum networks, claiming average gains of 5% execution time, 30% communication overhead, 40% wait time, and 2% fidelity over prior methods.
A Survey and Comparative Study of Hard and Soft Real-Time Dynamic Resource Allocation Strategies for Multi-/Many-Core Systems,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A System Aware Resource Allocation for Distributed Workflows in Quantum Computing Environments
Proposes system-aware allocation for distributed quantum workflows via modified graph algorithms on hybrid classical-quantum networks, claiming average gains of 5% execution time, 30% communication overhead, 40% wait time, and 2% fidelity over prior methods.