An online Riemannian gradient descent method for MPO-based quantum state tomography achieves linear convergence with quadratically scaling sample complexity and connects the problem to low TT-rank tensor completion.
Sketch tomography: Hybridizing classical shadow and matrix product state
2 Pith papers cite this work. Polarity classification is still indexing.
abstract
We introduce Sketch Tomography, an efficient procedure for quantum state tomography based on the classical shadow protocol used for quantum observable estimations. The procedure applies to the case where the ground truth quantum state is a matrix product state (MPS). The density matrix of the ground truth state admits a tensor train ansatz as a result of the MPS assumption, and we estimate the tensor components of the ansatz through a series of observable estimations, thus outputting an approximation of the density matrix. The procedure is provably convergent with a sample complexity that scales quadratically in the system size. We conduct extensive numerical experiments to show that the procedure outputs an accurate approximation to the quantum state. For observable estimation tasks involving moderately large subsystems, we show that our procedure gives rise to a more accurate estimation than the classical shadow protocol. We also show that sketch tomography is more accurate in observable estimation than quantum states trained from the maximum likelihood estimation formulation.
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A unified structured factorization framework for quantum state tomography that parametrizes the density matrix as FF^dagger, supports multiple priors, provides sample complexity bounds, and introduces projected gradient descent and power-method algorithms.
citing papers explorer
-
Online Riemannian Gradient Descent for Quantum State Tomography with Matrix Product Operators
An online Riemannian gradient descent method for MPO-based quantum state tomography achieves linear convergence with quadratically scaling sample complexity and connects the problem to low TT-rank tensor completion.
-
Structured Factorization Approaches for Quantum State Tomography
A unified structured factorization framework for quantum state tomography that parametrizes the density matrix as FF^dagger, supports multiple priors, provides sample complexity bounds, and introduces projected gradient descent and power-method algorithms.