The paper introduces a low‑overhead, fidelity‑aware scheduling framework for multi‑QPU quantum computing systems. It employs a Graph Neural Network to predict the expected execution fidelity of a given quantum circuit on each available QPU before compilation. Using these predictions, a tunable scheduler balances execution fidelity against parallelism, achieving near‑optimal fidelity assignments while reducing the computational cost compared to brute‑force compilation on every device.
By Innocenzo Fulginiti, Antonio Tudisco, Salvatore Zammuto, Patrick Hopf, Deborah Volpe, Helmut Seidl, Giovanna Turvani, Robert Wille, Christian B. Mendl, Martin Schulz
arXiv:2608. 12936v1 Announce Type: cross Abstract: As quantum computing progresses from proof-of-principle demonstrations toward practical utility, a significant impediment is the need to augment algorithmic feasibility with system-level optimization across heterogeneous hardware and software stacks.
By Harshkumar Oza, Aritra Sarkar, Syed Naqi Abbas, Rahul Bhowmick, Aryan Prakash, Prateek P Kulkarni, Krishna Kumar Sabapathy
As quantum computing progresses from proof-of-principle demonstrations toward practical utility, a significant impediment is the need to augment algorithmic feasibility with system-level optimization across heterogeneous hardware and software stacks. Quantum resource estimation (QRE) plays a central role in this transition, yet existing approaches remain largely compilation-heavy or domain-knowledge-guided symbolic annotations, and tightly coupled to long-term fault-tolerant assumptions, limiting their topical applicability.
arXiv:2508. 20134v2 Announce Type: replace Abstract: Programming quantum circuits at the OpenQASM level is essential for achieving hardware-aware optimization and reliable execution on noisy intermediate-scale quantum (NISQ) devices, yet it remains challenging due to the need for domain-specific planning, iterative code synthesis, and low-level calibration.
By Zhenxiao Fu, Lei Jiang, Yilun Xu, Gang Huang, Fan Chen
arXiv:2606. 07666v1 Announce Type: cross Abstract: Noisy intermediate-scale quantum (NISQ) processors are entering an early fault-tolerance regime where full quantum error correction carries prohibitive resource costs, yet lightweight error detection can meaningfully improve algorithmic success rates.
By Sumit Chongder (Indian Institute of Technology Jodhpur)
arXiv:2607. 29145v1 Announce Type: cross Abstract: Quantum software engineering is an emerging research field focusing on efficiently embedding the quantum programming paradigm into existing software ecosystems.
By Piotr Malkowski, Domenik Eichhorn, Joshua Ammermann, Rinor Kelmendi, Nick Poser, Patrick Hopf, Ina Schaefer
arXiv:2607. 11985v1 Announce Type: cross Abstract: Hybrid quantum-classical machine learning workflows repeatedly evaluate many small parametrized circuits during training and model exploration.
By Anton Firc, Martin Pere\v{s}\'ini, Vojt\v{e}ch Mr\'azek, Kamil Malinka, Vojt\v{e}ch Stan\v{e}k, Zbyn\v{e}k Li\v{c}ka, Nouhaila Innan, Walid El Maouaki, Alberto Marchisio, Muhammad Shafique
arXiv:2604.21863v2 Announce Type: replace-cross
Abstract: Deep reinforcement learning for quantum circuit optimization faces three bottlenecks: replay buffers that overlook temporal difference (TD) t...
By Akash Kundu, Sebastian Feld
Quantum Reinforcement Learning for Cost and Delay Tradeoffs in Quantum Cloud Orchestration proposes QRLQ, a scheduling framework that integrates parameterised quantum circuits with a dueling double deep Q‑network to balance execution cost and delay in quantum‑as‑a‑service environments. Simulation results show QRLQ outperforms heuristic baselines, achieving 5‑11% lower mean cost and up to 82% lower mean delay while maintaining fidelity within 2% of a fidelity‑greedy policy. Compared to a classical deep reinforcement learning baseline, QRLQ delivers comparable performance with 72% fewer trainable parameters.
By An N. H. Phan, Dang Van Huynh, Muhammad Usman, Hoa T. Nguyen
arXiv:2411.10406v4 Announce Type: replace-cross
Abstract: In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, sm...
By Masoud Mohseni, Artur Scherer, K. Grace Johnson, Oded Wertheim, Matthew Otten, Namit Anand, Navid Anjum Aadit, Yuri Alexeev, Gilad Ben-Shach, Kirk M. Bresniker, Kerem Y. Camsari, Barbara Chapman, Soumitra Chatterjee, Shuvro Chowdhury, Gebremedhin A. Dagnew, Tom Dvir, Aniello Esposito, Farah Fahim, Michael Ferguson, Marco Fiorentino, Archit Gajjar, Katerina Gratsea, Gaurav Gyawali, Christian Heiter, Ali H. Z. Kavaki, Abdullah Khalid, Xiangzhou Kong, Bohdan Kulchytskyy, Elica Kyoseva, Ruoyu Li, P. Aaron Lott, Igor L. Markov, Robert F. McDermott, Lucas Morais, Giacomo Pedretti, Pooja Rao, Eleanor Rieffel, Allyson Silva, John Sorebo, Panagiotis Spentzouris, Ziv Steiner, Boyan Torosov, Davide Venturelli, Robert J. Visser, Zak Webb, Xin Zhan, Yonatan Cohen, Pooya Ronagh, Alan Ho, Raymond G. Beausoleil, John M. Martinis
arXiv:2607. 29134v1 Announce Type: cross Abstract: Recent work suggests that relational database management systems (RDBMSs) can execute quantum circuit simulation by compiling the simulation into SQL workloads (primarily join-and-aggregate tensor contractions).
By Andrei Ilinescu, Aadi Patwardhan, Rihan Hai
arXiv:2605. 30358v2 Announce Type: replace Abstract: Quantum computing remains in the Noisy Intermediate-Scale Quantum (NISQ) era, with performance constrained by noise.
By Zhenxiao Fu, Lei Jiang, Fan Chen