Identify the purest quantum state among $K$ unknown $n$-qubit quantum states using total $N$ quantum state copies.

This paper reduces the gap between lower and upper bounds for fixed-confidence Best Arm Identification under global Differential Privacy to a small constant multiplicative factor by introducing a new lower bound and a near-optimal Top Two algorithm.

We identify the arm of maximum expected reward subject to expected cost constraints.