Pith. sign in

REVIEW 1 cited by

Learning pure quantum states (almost) without regret

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.18370 v2 pith:BZXUU56E submitted 2024-06-26 quant-ph cs.AIcs.LGstat.ML

classification quant-phcs.AIcs.LGstat.ML
keywords samplesregretmeasurementsquantumstatestatesdisturbanceincurring
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Online Quantum State Tomography via Stochastic Gradient Descent

    quant-ph 2025-07 conditional novelty 6.0 of 10

    Mini-batch stochastic gradient descent with Pauli measurements can reconstruct low-rank quantum states online, with local linear convergence guarantees and lower time complexity than prior non-convex methods.

Pith tools