arxiv
PublishedOctober 16, 2026 at 4:00 AM
Regret Lower Bound for Online Learning of Quantum States with Logarithmic Loss, with Applications to Quantum State Tomography and Confidence Sequences for Matrix Means
Publisher summary· verbatim
arXiv:2610.21273v1 Announce Type: new Abstract: We study the problem of online learning of quantum states with logarithmic loss, which is a quantum generalization of online portfolio selection and has applications to quantum state tomography, the task of estimating an unknown quantum state from meas
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivOptimal Hydra: Model Heterogeneous Federated Learning for LLMs using Data-Informed Hydra-Nets2darxivJudging the Judges: Confidence and Disagreement in Rubrics as Rewards2darxivContent associations with answer selection and engagement in supply chain community question answering2dThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗