Multi-armed quantum bandits: Exploration versus exploitation when learning properties of quantum states

Understand

We initiate the study of tradeoffs between exploration and exploitation in online learning of properties of quantum states.

• Given sequential oracle access to an unknown quantum state, in each round, we are tasked to choose an observable from a set of actions aiming to maximize its expectation value on the state (the reward).
• Information gained about the unknown state from previous rounds can be used to gradually improve the choice of action, thus reducing the gap between the reward and the maximal reward attainable with the given action set (the regret).
• We provide various information-theoretic lower bounds on the cumulative regret that an optimal learner must incur, and show that it scales at least as the square root of the number of rounds played.