Quantum Bandits

02/15/2020
by   Balthazar Casalé, et al.
0

We consider the quantum version of the bandit problem known as 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/14/2020

Quantum exploration algorithms for multi-armed bandits

Identifying the best arm of a multi-armed bandit is a central problem in...
research
05/30/2022

Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regrets

Multi-arm bandit (MAB) and stochastic linear bandit (SLB) are important ...
research
12/28/2022

The Improvement of Decision Tree Construction Algorithm Based On Quantum Heuristic Algorithms

This work is related to the implementation of a decision tree constructi...
research
05/06/2021

The complexity of a quantum system and the accuracy of its description

The complexity of the quantum state of a multiparticle system and the ma...
research
06/03/2022

Mirror modular cloning and fast quantum associative retrieval

We show that a quantum state can be perfectly cloned up to global mirror...
research
08/21/2009

Another Look at Quantum Neural Computing

The term quantum neural computing indicates a unity in the functioning o...
research
02/14/2022

Variational quantum solutions to the Shortest Vector Problem

A fundamental computational problem is to find a shortest non-zero vecto...

Please sign up or login with your details

Forgot password? Click here to reset