arXiv Machine Learning July 2, 2026 By Yuqi Huang, Vincent Y. F. Tan, Sharu Theresa Jose

Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization

Read the original on arXiv Machine Learning →

arXiv:2607. 01080v1 Announce Type: new Abstract: We investigate Gaussian process (GP) bandit optimization with quantum kernels, assuming the mean reward function lies in the reproducing kernel Hilbert space (RKHS) induced by the quantum kernel.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

reinforcement-learning

arXiv Machine Learning

Jul 13

Is data-efficient learning feasible with quantum models?

arXiv:2508. 19437v2 Announce Type: replace-cross Abstract: The importance of analyzing nontrivial datasets when testing quantum machine learning (QML) models is becoming increasingly prominent in literature, yet a cohesive framework for understanding dataset characteristics remains elusive.

By Alona Sakhnenko, Christian B. Mendl, Jeanette M. Lorenz

benchmarks safety

arXiv AI

Aug 5

Improved Quantum Algorithms for Reinforcement Learning Under a Generative Model

arXiv:2608. 02826v1 Announce Type: cross Abstract: Reinforcement learning is a subfield of machine learning that studies how an agent interacts with an environment in order to extract as large a reward as possible.

By Joao F. Doriguello

agents reinforcement-learning

arXiv Machine Learning

Jul 8

Benign Overfitting with Quantum Kernels

arXiv:2503. 17020v2 Announce Type: replace-cross Abstract: Kernel methods compare inputs through feature maps.

By Joachim Tomasi, Sandrine Anthoine, Hachem Kadri

arXiv Machine Learning

2d ago

Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms

arXiv:2608. 14319v1 Announce Type: new Abstract: We study quantum multi-armed bandits (QMAB) and quantum linear bandits (QLB) in the model of Wan et al.

By Maoli Liu, Zhuohua Li, John C. S. Lui

rag reinforcement-learning safety

arXiv AI

Jul 20

A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model

arXiv:2507. 22854v3 Announce Type: replace-cross Abstract: We propose novel classical and quantum online algorithms for learning finite- and infinite-horizon Markov Decision Processes (MDPs).

By Andris Ambainis, Joao F. Doriguello, Debbie Lim

agents reinforcement-learning

arXiv Machine Learning

Jul 1

Quantum Bayesian Networks Can Speed up Reinforcement Learning in Partially Observable Environments

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

reinforcement-learning benchmarks

Related stories

Is data-efficient learning feasible with quantum models?

Improved Quantum Algorithms for Reinforcement Learning Under a Generative Model

Benign Overfitting with Quantum Kernels

Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms

A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model

Quantum Bayesian Networks Can Speed up Reinforcement Learning in Partially Observable Environments