mlsanityData to 7 Oct 2026

Learning pure quantum states (almost) without regret

arXiv 2406.18370 ↗First posted 26 Jun 2024quant-ph cs.AI cs.LGcited by 5

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

  1. 2016Efficient quantum tomography IIcited by 54
  2. 2018Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffscited by 31
  3. 2019Lecture Notes: Selected topics on robust statistical learning theorycited by 17
  4. 2022When Does Adaptivity Help for Quantum State Learning?cited by 12
  5. 2024Linear bandits with polylogarithmic minimax regretcited by 8
  6. 2023Quantum contextual bandits and recommender systems for quantum datacited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 2.

5 papers.