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
The paper introduces MQSS-Selector, a reinforcement‑learning guided pass selection system for an MLIR compilation pipeline aimed at unified High Performance Computing‑Quantum Computing (HPCQC) infrastructures. It addresses the challenges of Noisy Intermediate‑Scale Quantum (NISQ) devices by integrating device selection, compiler‑pass optimization, and job queue scheduling into a single learning‑based framework. The selector can simultaneously optimize multiple objectives—fidelity, compilation time, and scheduling latency—while adapting to circuit characteristics and device conditions.
By Andre Youssefi (Leibniz Supercomputing Centre), Erc\"ument Kaya (Leibniz Supercomputing Centre, Technical University of Munich), Minh Chung (Leibniz Supercomputing Centre), Jorge Echavarria (Munich Quantum Valley), Laura B. Schulz (Argonne National Laboratory), Martin Schulz (Leibniz Supercomputing Centre, Technical University of Munich)
The paper presents a reinforcement‑learning approach to schedule link‑level entanglement in quantum networks, using a Markov Decision Process and double deep Q‑networks with message‑passing neural networks. The resulting policies achieve 100% success rates even when the link activation probability is reduced by up to 71% compared to baseline heuristics, and maintain at least 80% success when task placements are hardware‑restricted. The authors also develop metrics to interpret the learned policy and employ a large language model to generate a heuristic that matches the DQN performance, suggesting a scalable method for extracting interpretable strategies in large quantum networks.
By Leon Rode, Sumeet Khatri, Supartha Podder
arXiv:2507. 18606v2 Announce Type: replace-cross Abstract: Reinforcement learning (RL) provides a principled framework for decision-making in partially observable environments, which can be modeled as Markov decision processes and compactly represented through dynamic decision Bayesian networks.
By Gilberto Cunha, Alexandra Ram\^oa, Andr\'e Sequeira, Michael de Oliveira, Lu\'is Barbosa
arXiv:2605. 06734v2 Announce Type: replace-cross Abstract: Fast Weight Programmers (FWPs) encode temporal dependencies through dynamically updated parameters rather than recurrent hidden states.
By Kuo-Chung Peng, Samuel Yen-Chi Chen, Jiun-Cheng Jiang, Chen-Yu Liu, En-Jui Kuo, Yun-Yuan Wang, Prayag Tiwari, Andrea Ceschini, Chi-Sheng Chen, Yu-Chao Hsu, Chun-Hua Lin, Tai-Yue Li, Antonello Rosato, Massimo Panella, Simon See, Saif Al-Kuwari, Kuan-Cheng Chen, Nan-Yow Chen, Hsi-Sheng Goan
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
arXiv:2509. 08654v2 Announce Type: replace-cross Abstract: Quantum network routing requires online decisions under probabilistic entanglement generation, finite quantum memories, decoherence, imperfect operations, and classical feedback, while the controller has incomplete knowledge of the physical state.
By Amirhossein Taherpour, Abbas Taherpour, Tamer Khattab, Mazen Hasna
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.
The paper introduces Q‑MET, a quantum‑assisted framework that uses a hybrid quantum‑classical neural network to generate parameters for Wi‑Fi‑based human activity recognition models, drastically cutting the number of trainable parameters. By combining this approach with structured pruning during training, Q‑MET achieves 90–95% fewer trainable parameters than traditional backpropagation while preserving or improving classification accuracy. The method also yields 75–85% model sparsity for lightweight inference with less than 2% accuracy loss, enabling deployment on resource‑constrained devices.
By To Truong An, Jie Zhang, Guolin Yin, Junqing Zhang, Yanjiao Li, Trung Q. Duong, Simon L. Cotton
The paper introduces APGEM, an adaptive controller that dynamically selects among four error‑mitigation techniques—Zero‑Noise Extrapolation, Probabilistic Error Cancellation, Clifford Data Regression, and Readout Error Mitigation—based on a utility function and Q‑learning scores. Applied to a realistic Delhi‑based Capacitated Vehicle Routing Problem, the adaptive approach improves the quantum reinforcement learning agent’s approximation ratios from 0.84‑0.87 to 0.92‑0.94 under high noise, outperforming constructive heuristics and approaching metaheuristics. The controller’s strategy shifts from a Clifford‑data‑regression‑heavy regime early in training to a balanced use of all techniques as training progresses, demonstrating regime‑dependent selection.
By Shabir Ahmad Sofi, Bisma Majid, Mir Mohammad Yousuf
arXiv:2607. 18288v1 Announce Type: new Abstract: Load imbalance across edge and cloud layers degrades latency performance in hierarchical edge-cloud computing (HECC) systems under dynamic task arrivals and heterogeneous resources, leading to severe queuing delays and inefficient resource utilization.
By Vo Phi Son, Van-Dinh Nguyen, Ngoc Hung Nguyen, Trinh Van Chien, Symeon Chatzinotas