The Single-Copy Quantum Bandit Is Classical: An Exact Spectral Collapse
Abstract
We study multi-armed bandits whose arms supply unknown quantum states and whose mean rewards are defined by a known effect $F$. Each fresh copy may be measured by an arbitrary, adaptively chosen POVM. We prove an exact collapse: the measured relative entropy from an arm state to its confusing reward half-space equals the classical Burnetas-Katehakis functional of $F$'s spectral statistics, and the spectral measurement of $F$ together with an explicit least-favorable state, built from the derivat...
Description / Details
We study multi-armed bandits whose arms supply unknown quantum states and whose mean rewards are defined by a known effect . Each fresh copy may be measured by an arbitrary, adaptively chosen POVM. We prove an exact collapse: the measured relative entropy from an arm state to its confusing reward half-space equals the classical Burnetas-Katehakis functional of 's spectral statistics, and the spectral measurement of together with an explicit least-favorable state, built from the derivative of the matrix logarithm, forms a saddle point of the underlying measurement game. Consequently, spectral measurement followed by classical KL-UCB is asymptotically instance-optimal among all consistent single-copy policies, in every finite dimension and for every reward effect under the stated nondegeneracy assumptions: adaptive and randomized measurement design cannot improve the leading logarithmic regret coefficient, and neither can storing copies for later single-copy measurement. A self-contained finite-time bound covers general effects and boundary distributions. Any further improvement must come from measurements outside the single-copy class. For consistent policies with arbitrary quantum memory, an amortized relative-entropy argument gives a converse with the Umegaki half-space divergence, and the two per-arm regret floors, and , coincide if and only if the arm commutes with . Whether the Umegaki floor is attainable involves a composite quantum Stein problem and a separate reduction to adaptive regret; we pose it as an open problem, with two-copy numerical evidence.
Source: arXiv:2609.40339v1 - http://arxiv.org/abs/2609.40339v1 PDF: https://arxiv.org/pdf/2609.40339v1 Original Link: http://arxiv.org/abs/2609.40339v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Oct 1, 2026
Quantum Computing
Quantum Physics
0