Research map / Bandits and online learning / Multi-armed bandits
Quantum Exploration Algorithms for Multi-Armed Bandits
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 |
|---|---|---|---|
| Use variable-time amplitude amplification and estimation with an adaptive stopping-time algorithm | Quantum best-arm identification · Bernoulli multi-armed bandit, fixed-confidence | query complexity: O(H) -> \tilde{O}(\sqrt{H}) | Helped |
| Apply the quantum adversary method to the bandit oracle | Quantum best-arm identification · Bernoulli multi-armed bandit, fixed-confidence | quantum query complexity lower bound: \tilde{O}(\sqrt{H}); lower bound \Omega(\sqrt{H}) | Mixed |
Closest papers by meaning
- Quantum Best Arm Identification with Quantum Oracles (AAAI 2025 · similarity 0.92)
- Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret (ICML 2024 · similarity 0.86)
- Accelerating Quantum Reinforcement Learning with a Quantum Natural Policy Gradient Based Approach (ICML 2025 · similarity 0.86)
- Quantum Algorithm for Online Exp-concave Optimization (ICML 2024 · similarity 0.85)
- Oracle-Efficient Combinatorial Semi-Bandits (NeurIPS 2025 · similarity 0.85)
- Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes (ICML 2025 · similarity 0.85)
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.