mlsanityData to 7 Oct 2026

Learning Pure Quantum States in Any Dimension (Almost) Without Regret

arXiv 2605.09019 ↗First posted 9 May 2026quant-ph cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We extend quantum state tomography with minimal cumulative disturbance, first investigated in [arXiv:2406.18370], to arbitrary finite-dimensional pure states. A learner sequentially receives fresh copies of an unknown pure state, chooses a rank-one projector for each copy using the previous outcomes, and performs the corresponding two-outcome projective measurement. The goal is to learn the state while keeping the chosen projectors close to the unknown state in order to minimize disturbance. The qubit solution relies on the special geometry of the Bloch sphere and does not extend directly to qudits, where pure states form a curved manifold. We show that this obstruction can be overcome by working locally on the pure-state manifold. The algorithm proceeds in epochs. In each epoch, it fixes a current estimate, measures pairs of nearby rank-one projectors obtained by moving in opposite tangent directions, and takes differences of the corresponding outcomes. This gives an exact linear observation of the tangent component of the error. The resulting local linear models are combined with a robust variance-adaptive estimator and a hot-start regularization that transfers precision across epochs. For every unknown pure state in dimension (d), after (T) measured copies, our protocol achieves cumulative regret (O(d3log2 T)), and at each intermediate time (t≤ T) its current estimate has online infidelity (O(d3log(T)/t)). Hence, pure-state tomography with essentially no cumulative disturbance is not a peculiarity of qubits but a geometric phenomenon that persists for qudits.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 13 references that are in the map. First posted on arXiv 9 May 2026.

Builds on

5 of 13 references.

References · 5

  1. 2018Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffscited by 31
  2. 2022When Does Adaptivity Help for Quantum State Learning?cited by 12
  3. 2024Linear bandits with polylogarithmic minimax regretcited by 8
  4. 2024Learning pure quantum states (almost) without regretcited by 5
  5. 2025Quantum state-agnostic work extraction (almost) without dissipationcited by 1

Built on by

Not cited yet.