QFOR: A Fidelity-aware Orchestrator for Quantum Computing Environments using Deep Reinforcement Learning
quant-ph, cs.ET
Submitted: 2025-08-07
Updated: 2025-08-07
Journal ref: ACM Transactions on Quantum Computing (2026)
DOI: 10.1145/3799898
License: http://creativecommons.org/licenses/by/4.0/
The gist: Quantum cloud computing enables remote access to quantum processors, yet the heterogeneity and noise of available quantum hardware create significant challenges for efficient resource orchestration.
Terminology
Abstract
Quantum cloud computing enables remote access to quantum processors, yet the heterogeneity and noise of available quantum hardware create significant challenges for efficient resource orchestration. These issues complicate the optimization of quantum task allocation and scheduling, as existing heuristic methods fall short in adapting to dynamic conditions or effectively balancing execution fidelity and time. Here, we propose QFOR, a Quantum Fidelity-aware Orchestration of tasks across heterogeneous quantum nodes in cloud-based environments using Deep Reinforcement learning. We model the quantum task orchestration as a Markov Decision Process and employ the Proximal Policy Optimization algorithm to learn adaptive scheduling policies, using IBM quantum processor calibration data for noise-aware performance estimation. Our configurable framework balances overall quantum task execution fidelity and time, enabling adaptation to different operational priorities. Extensive evaluation demonstrates that QFOR is adaptive and achieves significant performance with 29.5-84% improvements in relative fidelity performance over heuristic baselines. Furthermore, it maintains comparable quantum execution times, contributing to cost-efficient use of quantum computation resources.
Sources
- Benchmarking a trapped-ion quantum computer with 30 qubits
- Qonductor: A Cloud Orchestrator for Quantum Computing
- Rainbow: Combining Improvements in Deep Reinforcement Learning
- QuSplit: Achieving Both High Fidelity and Throughput via Job Splitting on Noisy Quantum Computers
- Tune: A Research Platform for Distributed Model Selection and Training
- Adaptive Job Scheduling in Quantum Clouds Using Reinforcement Learning
- Quantum Cloud Computing: A Review, Open Problems, and Future Directions
- MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
- Benchmarking Quantum Computers and the Impact of Quantum Noise
- High-Dimensional Continuous Control Using Generalized Advantage Estimation
- Proximal Policy Optimization Algorithms
- Quality, Speed, and Scale: three key attributes to measure the performance of near-term quantum computers
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians