Adaptive job and resource management for the growing quantum cloud
Gokul Subramanian Ravi, Kaitlin N. Smith, Prakash Murali, Frederic T., Chong

TL;DR
This paper introduces an adaptive job scheduling approach for quantum cloud computing that predicts fidelity and queuing times to optimize resource management, significantly reducing wait times and enhancing fidelity.
Contribution
It presents a novel predictive scheduling framework for quantum clouds, incorporating fidelity and queuing time models to improve efficiency over traditional methods.
Findings
Reduced wait times by over 3x
Improved fidelity by over 40% in specific scenarios
Effective on simulated IBM quantum systems
Abstract
As the popularity of quantum computing continues to grow, efficient quantum machine access over the cloud is critical to both academic and industry researchers across the globe. And as cloud quantum computing demands increase exponentially, the analysis of resource consumption and execution characteristics are key to efficient management of jobs and resources at both the vendor-end as well as the client-end. While the analysis and optimization of job / resource consumption and management are popular in the classical HPC domain, it is severely lacking for more nascent technology like quantum computing. This paper proposes optimized adaptive job scheduling to the quantum cloud taking note of primary characteristics such as queuing times and fidelity trends across machines, as well as other characteristics such as quality of service guarantees and machine calibration constraints. Key…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCloud Computing and Resource Management · Distributed and Parallel Computing Systems · Quantum Computing Algorithms and Architecture
