Quantum Bandits
Not on the map. Why?
Abstract (arXiv)
We consider the quantum version of the bandit problem known as em best arm identification (BAI). We first propose a quantum modeling of the BAI problem, which assumes that both the learning agent and the environment are quantum; we then propose an algorithm based on quantum amplitude amplification to solve BAI. We formally analyze the behavior of the algorithm on all instances of the problem and we show, in particular, that it is able to get the optimal solution quadratically faster than what is known to hold in the classical case.
Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 7; 2024: 0; 2025: 5; 2026: 4.
18 papers.
Sort:
- 2022Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regretscited by 19
- 2023Quantum Bayesian Optimizationcited by 12
- 2023Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regretcited by 9
- 2023Quantum Heavy-tailed Banditscited by 7
- 2023Quantum Computing Provides Exponential Regret Improvement in Episodic Reinforcement Learningcited by 6
- 2021Quantum Perceptron Revisited: Computational-Statistical Tradeoffscited by 5
- 2023Quantum contextual bandits and recommender systems for quantum datacited by 4
- 2025Accelerating Quantum Reinforcement Learning with a Quantum Natural Policy Gradient Based Approachcited by 4
- 2025Quantum Lipschitz Banditscited by 4
- 2023Multi-Armed Bandits and Quantum Channel Oraclescited by 3
- 2023Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processescited by 3
- 2025Quantum Algorithms for Projection-Free Sparse Convex Optimizationcited by 0
6 more
- 2025Quantum spatial best-arm identification via quantum walkscited by 0
- 2025Variational Quantum Circuits in Offline Contextual Bandit Problemscited by 0
- 2026Towards Noise-Resilient Quantum Multi-Armed and Stochastic Linear Banditscited by 0
- 2026Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimizationcited by 0
- 2026Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithmscited by 0
- 2026Quantum Monte Carlo Tree Search with Fixed Confidencecited by 0
- 2026Quantum Monte Carlo Tree Search with Fixed Confidence27 Sep 2026
- 2026Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms14 Aug 2026
- 2026Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization1 Jul 2026
- 2026Towards Noise-Resilient Quantum Multi-Armed and Stochastic Linear Bandits19 Mar 2026
- 2025Variational Quantum Circuits in Offline Contextual Bandit Problems9 Sep 2025
- 2025Quantum spatial best-arm identification via quantum walks7 Sep 2025
- 2025Quantum Algorithms for Projection-Free Sparse Convex Optimization11 Jul 2025
- 2025Quantum Lipschitz Bandits3 Apr 2025
- 2025Accelerating Quantum Reinforcement Learning with a Quantum Natural Policy Gradient Based Approach27 Jan 2025
- 2023Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes18 Oct 2023
- 2023Quantum Bayesian Optimization9 Oct 2023
- 2023Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret21 Feb 2023
6 more
- 2023Quantum Computing Provides Exponential Regret Improvement in Episodic Reinforcement Learning16 Feb 2023
- 2023Quantum contextual bandits and recommender systems for quantum data31 Jan 2023
- 2023Quantum Heavy-tailed Bandits23 Jan 2023
- 2023Multi-Armed Bandits and Quantum Channel Oracles20 Jan 2023
- 2022Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regrets30 May 2022
- 2021Quantum Perceptron Revisited: Computational-Statistical Tradeoffs4 Jun 2021
- 2022Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regretscited by 19
- 2023Quantum Bayesian Optimizationcited by 12
- 2023Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regretcited by 9
- 2023Quantum Heavy-tailed Banditscited by 7
- 2023Quantum Computing Provides Exponential Regret Improvement in Episodic Reinforcement Learningcited by 6
- 2021Quantum Perceptron Revisited: Computational-Statistical Tradeoffscited by 5
- 2023Quantum contextual bandits and recommender systems for quantum datacited by 4
- 2025Accelerating Quantum Reinforcement Learning with a Quantum Natural Policy Gradient Based Approachcited by 4
- 2025Quantum Lipschitz Banditscited by 4
- 2023Multi-Armed Bandits and Quantum Channel Oraclescited by 3
- 2023Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processescited by 3
- 2025Quantum Algorithms for Projection-Free Sparse Convex Optimizationcited by 0
12 most cited of 18 All 18 (JSON)
- 2026Quantum Monte Carlo Tree Search with Fixed Confidence27 Sep 2026
- 2026Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms14 Aug 2026
- 2026Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization1 Jul 2026
- 2026Towards Noise-Resilient Quantum Multi-Armed and Stochastic Linear Bandits19 Mar 2026
- 2025Variational Quantum Circuits in Offline Contextual Bandit Problems9 Sep 2025
- 2025Quantum spatial best-arm identification via quantum walks7 Sep 2025
- 2025Quantum Algorithms for Projection-Free Sparse Convex Optimization11 Jul 2025
- 2025Quantum Lipschitz Bandits3 Apr 2025
- 2025Accelerating Quantum Reinforcement Learning with a Quantum Natural Policy Gradient Based Approach27 Jan 2025
- 2023Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes18 Oct 2023
- 2023Quantum Bayesian Optimization9 Oct 2023
- 2023Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret21 Feb 2023
12 newest of 18 All 18 (JSON)