quant-phSep 8, 2026

A Block Tensor Train Burer-Monteiro Framework for Low-Rank Quantum State Tomography

Authors: Shakir Showkat Sofi, Charlotte Vermeylen, Fatemeh Mohammadi, Lieven De Lathauwer

Read PDF
Ask AI
Cite

Copy citation

DOINot available for this paper

Abstract

Quantum state tomography is a fundamental technique for estimating the state of a quantum system from measured data and plays a crucial role in evaluating the performance of quantum devices. However, standard estimation methods become computationally prohibitive as the system size increases due to the exponential growth of the density matrix, describing a quantum state, with the number of qubits. We propose a low-rank tensor-network framework for mixed-state quantum state tomography based on a block tensor train (Block-TT) factorization. Specifically, the density matrix is represented as the contraction of a Block-TT with its Hermitian transpose, yielding a TT analogue of the Burer-Monteiro factorization. This parameterization guarantees Hermiticity and positive semidefiniteness by construction while compressing the number of optimization variables from exponential to linear in the number of qubits. Building on this representation, we develop single-site and two-site density matrix renormalization group (DMRG) algorithms for estimating quantum states from compressed measurements. The resulting methods operate directly on the compressed parameterization, support adaptive rank refinement, and exploit efficient tensor-network contractions for expectation-value evaluation. The framework is applicable to a broad class of low-rank quantum states, including pure states, nearly pure states, and ground states that admit accurate tensor-network approximations. Numerical experiments demonstrate accurate state reconstruction from limited measurements together with substantial reductions in memory requirements and computational cost compared with conventional low-rank tomography methods.

Explore similar work

CardsList
Sep 9, 2026quant-ph

Optimal Low-Rank Quantum State Tomography with Bounded-Sample Joint Measurements

We determine the optimal sample complexity of low-rank quantum state tomography when each measurement may act jointly on at most tt samples. For sufficiently small ε\varepsilon, estimating an unknown state on Cd\mathbb{C}^d of rank at most rr to trace norm error ε\varepsilon with constant success probability requires, and is achievable with, Θ(drε2max⁡{1,rt}) Θ\left( \frac{dr}{\varepsilon^2} \max\left\{1,\frac r{\sqrt t}\right\} \right) samples. The lower bound allows the protocol to choose each joint measurement adaptively using all previous classical outcomes; the matching upper bound is nonadaptive. Thus joint measurements on at most tt samples improve the complexity of algorithms making single-sample measurements by at most a factor t\sqrt t. Further, measuring order r2r^2 samples jointly is necessary and sufficient to attain the unrestricted collective rate. For the lower bound, we vary the support of a state with fixed uniform spectrum and bound the Fisher information trace of every joint measurement on tt samples. The adaptive Fisher chain rule and the van Trees inequality then give the trace norm lower bound. For the upper bound, we construct and analyze a nonadaptive tomography protocol based on a Gaussian joint measurement. An explicit second moment identity and a conditional Gaussian law outside the state's support give a rank-dependent error analysis, yielding the matching rate.
Ashwin Nayak, Xingyu Zhou
N$-Qubit Stabilizer StatesOptimal Sample ComplexitySpectral NormMutual InformationTomography
AskPDF
May 9, 2026quant-ph

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

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 dd, after TT measured copies, our protocol achieves cumulative regret O(d3log⁡2T)\mathcal{O}(d^3\log^2 T), and at each intermediate time t≤Tt\leq T its current estimate has online infidelity O(d3log⁡(T)/t)\mathcal{O}(d^3\log(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.
Josep Lumbreras, Marco Tomamichel
N$-Qubit Stabilizer StatesO(T^Β)$ Simultaneous RegretRegret
AskPDF
Jul 13, 2026quant-ph

Fixed-Protocol Amortized MPS Tomography with Conformalized Predictive Uncertainty

Quantum state tomography is sample-starved, and the states one prepares live on a narrow, learnable manifold. A k=0k{=}0 prior-only control shows that on concentrated families a prior estimate is already near-optimal, so ``high fidelity at few measurements'' can be family memorization rather than tomography; genuine measurement-efficiency needs a model that conditions on the measurements and demonstrably uses them. On a shared matrix-product-state (MPS) core parameterization we study two routes. ApproachA learns a generative prior over MPS cores with measurement-guided posterior inference (gold-standard-validated, but whose few-measurement accuracy the control shows is largely the prior). ApproachB, our main proposal, is a \emph{fixed-protocol amortized} MPS estimator trained once with a gauge-invariant fidelity loss; we deliberately do not rest it on a permutation-invariant set encoder (a plain MLP matches it). The decisive lever is the measurement design: motivated by the fact that local reduced density matrices determine a χχ-MPS, conditioning on an \emph{informative local} Pauli set rather than random strings turns a modest, memorization-prone estimator into a high-fidelity one (≈ ⁣0.95\approx\!0.95, up to +0.59+0.59 over prior-only, decisively passing a shuffled-measurement control). A dropout ensemble, conformally recalibrated, gives ≈ ⁣90%\approx\!90\%-coverage intervals -- including for observables never measured, where a shot-based interval does not exist. Quality holds as the system grows (fidelity 0.900.90 at n=10n{=}10, gain \emph{growing} in nn; 0.880.88 at bond dimension χ=4χ{=}4), the parameterization is polynomial (native contraction to 2020 qubits), and we close the loop on IBM hardware (55 states at 0.970.97 from hardware-measured Paulis).
Jian Xu, Delu Zeng, John Paisley +1
N$-Qubit Stabilizer StatesDistributional FidelityTomographyPosteriorConformal Prediction
AskPDF