Quantum Non-Linear Bandit Optimization
Zakaria Shams Siam, Chaowen Guan, Chong Liu
Abstract
We study non-linear bandit optimization where the learner maximizes a black-box function with zeroth order function oracle, which has been successfully applied in many critical applications such as drug discovery and materials design. Existing works have showed that with the aid of quantum computing, it is possible to break the classical Ω(√T) regret lower bound and achieve the new O(poly log T) upper bound. However, they usually assume that the objective function sits within the reproducing kernel Hilbert space and their algorithms suffer from the curse of dimensionality. In this paper, we propose the new Q-NLB-UCB algorithm which enjoys an input dimension-free O(poly log T) upper bound, making it applicable for high-dimensional tasks. At the heart of our algorithm design are quantum Monte Carlo mean estimator, parametric function approximation technique, and a new quantum non-linear regression oracle, which can be of independent interests in more quantum machine learning problems. Our algorithm is also validated for its efficiency compared with other quantum algorithms on both high-dimensional synthetic and real-world tasks.
BibTeX
@inproceedings{aaai2026_quantumnonlinear,
title = {Quantum Non-Linear Bandit Optimization},
author = {Zakaria Shams Siam and Chaowen Guan and Chong Liu},
booktitle = {AAAI 2026},
year = {2026}
}