Learning pure quantum states (almost) without regret
Not on the map. Why?
Abstract (arXiv)
We initiate the study of sample-optimal quantum state tomography with minimal disturbance to the samples. Can we efficiently learn a precise description of a quantum state through sequential measurements of samples while at the same time making sure that the post-measurement state of the samples is only minimally perturbed? Defining regret as the cumulative disturbance of all samples, the challenge is to find a balance between the most informative sequence of measurements on the one hand and measurements incurring minimal regret on the other. Here we answer this question for qubit states by exhibiting a protocol that for pure states achieves maximal precision while incurring a regret that grows only polylogarithmically with the number of samples, a scaling that we show to be optimal.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 6 of its 34 references that are in the map. First posted on arXiv 26 Jun 2024.
Builds on
6 of 34 references.
References · 6
- 2016Efficient quantum tomography IIcited by 54
- 2018Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffscited by 31
- 2019Lecture Notes: Selected topics on robust statistical learning theorycited by 17
- 2022When Does Adaptivity Help for Quantum State Learning?cited by 12
- 2024Linear bandits with polylogarithmic minimax regretcited by 8
- 2023Quantum contextual bandits and recommender systems for quantum datacited by 4
Built on by
Citing papers per year: 2025: 3; 2026: 2.
5 papers.
- 2025Variational Quantum Optimization with Continuous Banditscited by 2
- 2025Online Learning of Pure States is as Hard as Mixed Statescited by 1
- 2025Quantum state-agnostic work extraction (almost) without dissipationcited by 1
- 2026Learning Pure Quantum States in Any Dimension (Almost) Without Regretcited by 0
- 2026Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithmscited by 0
- 2026Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms14 Aug 2026
- 2026Learning Pure Quantum States in Any Dimension (Almost) Without Regret9 May 2026
- 2025Quantum state-agnostic work extraction (almost) without dissipation14 May 2025
- 2025Variational Quantum Optimization with Continuous Bandits6 Feb 2025
- 2025Online Learning of Pure States is as Hard as Mixed States2 Feb 2025