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. 13422v2 Announce Type: replace-cross Abstract: We develop theoretical foundations for a practical quantum-advantage mechanism in quantum-informed machine learning for chaotic dynamical systems.
By Maida Wang, Xiao Xue, Minh Chung, Peter V. Coveney
arXiv:2606. 08276v1 Announce Type: cross Abstract: Quantum reinforcement learning (QRL) is a promising approach to learn effective decision strategies across several applications with stochastic environments.
By Alexander DeRieux, Walid Saad
arXiv:2606. 09778v1 Announce Type: cross Abstract: Hard safety filters are increasingly placed downstream of learned controllers to guarantee constraint satisfaction at run time.
By Yifan Wang
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:2608. 15715v1 Announce Type: cross Abstract: Quantum feedback control requires acting on noisy continuous measurement records without direct access to the underlying quantum state.
By Priyanshi Singh, Krishna Bhatia
arXiv:2602. 14735v2 Announce Type: replace-cross Abstract: The performance of quantum classifiers is typically analyzed through global state distinguishability or the trainability of variational models.
By Ait Haddou Marwan
arXiv:2606. 10448v1 Announce Type: cross Abstract: The financial market is a typical low signal-to-noise ratio (SNR) setting, which often destabilizes off-policy maximum-entropy methods like Soft Actor-Critic (SAC).
By Zeyu Liu, Xuanzhi Feng, Sing Kwong Lai, Yuanchen Gao, Xiaoyi Pang, Hualei Zhang, Jingcai Guo, Jie Zhang, Song Guo
arXiv:2504. 05336v4 Announce Type: replace-cross Abstract: A recurring weakness in quantum machine learning (QML) is that reported ``quantum advantages'' are seldom tested against a \emph{capacity-matched} classical control, leaving it unclear whether a gain comes from the quantum substrate or from the architectural change that accompanies it.
By Chi-Sheng Chen, En-Jui Kuo
arXiv:2605. 12713v3 Announce Type: replace-cross Abstract: In the field of quantum reservoir computing (QRC), many different computational models and architectures have been proposed.
By Erik L. Connerty, Ethan N. Evans
The paper introduces QEMScore, a metric that compares learned quantum error mitigators to capacity‑matched controls that do not use measurement data. Using simulated circuits with exact ideal answers, the study finds that many mitigators gain little from measurement inputs, with a plain polynomial model often outperforming them. On real hardware data, however, measurement inputs can provide predictive benefits, highlighting that performance depends on representation and protocol specifics.
By Yue Zhao, Huayue Gu, Yushun Dong, Xiyang Hu
The paper studies how an eavesdropper can adaptively attack quantum key distribution (QKD) systems when channel noise and device drift vary over time. By modeling the attack as a constrained Markov decision process and using reinforcement learning to jointly search gate structures and rotation angles, the authors construct compact attack circuits that perform near the theoretical upper bound for both device‑independent E91 and BB84 protocols under realistic noise models. The results show that adaptive attacks can significantly increase the eavesdropper’s information compared to fixed‑circuit strategies, and that the learned attacks recover known optimal cloners and key‑rate bounds.
By Marcel Mordarski, Benjamin Gras, Abdelrahman Shehata, Daniel Budina, Roberto Bondesan