Research map / Probabilistic and scientific modeling / Bayesian optimization
Quantum Bayesian Optimization
Zhongxiang Dai, Gregory Kang Ruey Lau, Arun Verma, Yao Shu, Bryan Kian Hsiang Low, Patrick Jaillet
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace classical GP-UCB with Q-GP-UCB (quantum Monte Carlo observations) | Q-GP-UCB · Synthetic, bounded (Bernoulli) noise, SE-kernel GP sample, 20 points | cumulative regret | Improved |
| replace classical GP-UCB with Q-GP-UCB | Q-GP-UCB · Synthetic, Gaussian noise | cumulative regret | Improved |
| replace classical GP-UCB with Q-GP-UCB | Q-GP-UCB · AutoML SVM hyperparameter tuning | cumulative regret | Improved |
| use kernelized (GP) bandits instead of linear bandits (LinUCB, Q-LinUCB) | Q-GP-UCB and GP-UCB · Synthetic non-linear reward and AutoML | cumulative regret | Improved |
| add simulated IBM quantum noise model to the Qiskit simulation | Q-GP-UCB · Synthetic experiment with noisy quantum simulation | cumulative regret | Hurt |
| run on a real quantum computer instead of simulated noise | Q-GP-UCB · Synthetic experiment on real quantum hardware | cumulative regret | Hurt |
| replace quantum Monte Carlo with classical MC estimation (theory) (ablation) | Q-GP-UCB · regret bound analysis | regret upper bound | Hurt |
| use the tighter confidence ellipsoid analysis for Q-LinUCB | Q-LinUCB · regret bound (theory) | regret upper bound | Improved |
Closest papers by meaning
- Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization (NeurIPS 2025 · similarity 0.88)
- Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret (ICML 2024 · similarity 0.88)
- Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance (ICML 2025 · similarity 0.87)
- Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes (ICML 2025 · similarity 0.87)
- Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency (ICML 2024 · similarity 0.87)
- Quantum Algorithm for Online Exp-concave Optimization (ICML 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
