Mixed state tomography reduces to pure state tomography

Angelos Pelecanos, Jack Spilecki, Ewin Tang, John Wright (Nov 21 2025).

Abstract: A longstanding belief in quantum tomography is that estimating a mixed state is far harder than estimating a pure state. This is borne out in the mathematics, where mixed state algorithms have always required more sophisticated techniques to design and analyze than pure state algorithms. We present a new approach to tomography demonstrating that, contrary to this belief, state-of-the-art mixed state tomography follows easily and naturally from pure state algorithms. We analyze the following strategy: given $n$ copies of an unknown state $\rho$, convert them into copies of a purification $|\rho\rangle$; run a pure state tomography algorithm to produce an estimate of $|\rho\rangle$; and output the resulting estimate of $\rho$. The purification subroutine was recently discovered via the "acorn trick" of Tang, Wright, and Zhandry. With this strategy, we obtain the first tomography algorithm which is sample-optimal in all parameters. For a rank-$r$ $d$-dimensional state, it uses $n = O((rd + \log(1/\delta))/\varepsilon)$ samples to output an estimate which is $\varepsilon$-close in fidelity with probability at least $1-\delta$. This algorithm also uses poly$(n)$ gates, making it the first gate-efficient tomography algorithm which is sample-optimal even in terms of the dimension $d$ alone. Moreover, with this method we recover essentially all results on mixed state tomography, including its applications to tomography with limited entanglement, classical shadows, and quantum metrology. Our proofs are simple, closing the gap in conceptual difficulty between mixed and pure tomography. Our results also clarify the role of entangled measurement in mixed state tomography: the only step of the algorithm which requires entanglement across copies is the purification step, suggesting that, for tomography, the reason entanglement is useful is for consistent purification.

Arxiv: https://arxiv.org/abs/2511.15806