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: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
The review examines how machine learning can adapt quantum combinatorial optimization workflows by learning decisions such as formulation, penalties, shot budgets, and backend selection. It categorizes the literature into three paradigms—AI for quantum optimization, quantum for AI-driven optimization, and AI‑quantum co‑optimization—and analyzes 119 papers, finding stronger evidence for AI assisting quantum methods than for quantum enhancing learned optimizers. The authors highlight limited experimental controls, introduce an M0‑M5 evidence hierarchy, and argue that scaling is a systems problem requiring careful allocation of classical and quantum resources.
By Hoong Chuin LAU
arXiv:2607. 00365v1 Announce Type: cross Abstract: Artificial intelligence (AI) and quantum information (QI) are rapidly co-evolving.
By Min Chen, Yu Gan, Xin Jin, Yuqing Li, Junqi Wang, Zeguan Wu, Yunfei Wang, Bingzhi Zhang, Priyam Srivastava, Tianlong Chen, Ankit Kulshrestha, Yuan Liu, Juan Jos\'e Mendoza-Arenas, Kaushik P. Seshadreesan, Sarvagya Upadhyay, Xueyue Zhang, Quntao Zhuang, Junyu Liu
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:2608. 19306v1 Announce Type: cross Abstract: Given a set of input states, we consider the task of predicting the expectation value of a Pauli observable at the output of an unknown quantum evolution, using only a limited number of measurements.
By Jonas J\"ager, Yaroslav Khmelnitskiy, Paolo Braccia, Artur Miroszewski, Diego Garc\'ia-Mart\'in, M. Cerezo, Piotr Czarnik
arXiv:2606. 09734v1 Announce Type: cross Abstract: Training parameterised quantum circuits (PQCs) on quantum hardware is bottlenecked by the measurement cost of gradient estimation, which under the parameter-shift rule scales linearly in the number of trainable parameters and dominates the total shot budget of training at scale.
By Brian Coyle, Snehal Raj, Virag Umathe, El Amine Cherrat, Elham Kashefi
The paper introduces Conformalized Quantum DeepONet Ensembles, a framework that combines Quantum Orthogonal Neural Networks (QOrthoNNs) with split conformal calibration to address the quadratic cost of dense neural layers and unreliable uncertainty quantification in operator learning. It demonstrates that QOrthoNNs achieve ×O(n) hidden‑layer running‑time scaling, improving on the ×O(n^2) cost of classical dense layers, while the ensemble approach provides a finite‑sample, distribution‑free lower bound on coverage for new input‑output function pairs. Experiments on synthetic benchmarks and real‑world power‑system dynamics confirm accurate predictions and empirical coverage close to the target under both ideal and noisy quantum simulations.
By Purav Matlia, Christian Moya, Guang Lin
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:2606. 01291v1 Announce Type: cross Abstract: Training Variational Quantum Circuits (VQCs) under Noisy Intermediate-Scale Quantum (NISQ) constraints introduces severe computational limitations: classical statevector simulation memory scales exponentially ($\mathcal{O}(2^n)$), and global cost functions suffer from barren plateaus where gradient variance decays exponentially ($\mathcal{O}(1/2^n)$).
By Syed Farhan Ahmad, Gregory T. Byrd
arXiv:2606. 12816v2 Announce Type: replace-cross Abstract: Quantum circuit routing is a key step in compiling programs for noisy intermediate-scale quantum processors.
By Yash Vardhan Tomar, Dheeraj Peddireddy