Papers › Beating full state tomography for unentangled spectrum estimation
Beating full state tomography for unentangled spectrum estimation
Angelos Pelecanos, Xinyu Tan, Ewin Tang, John Wright
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
How many copies of a mixed state ρ∈ℂ^(d ×d) are needed to learn its spectrum? To date, the best known algorithms for spectrum estimation require as many copies as full state tomography, suggesting the possibility that learning a state's spectrum might be as difficult as learning the entire state. We show that this is not the case in the setting of unentangled measurements, by giving a spectrum estimation algorithm that uses n = O(d³·(loglog(d) / log(d))⁴ ) copies of ρ, which is asymptotically fewer than the n = Ω(d³) copies necessary for full state tomography. Our algorithm is inspired by the technique of local moment matching from classical statistics, and shows how it can be applied in the quantum setting. As an important subroutine in our spectrum estimation algorithm, we give an estimator of the k-th moment tr(ρᵏ) which performs unentangled measurements and uses O(d^(3-2/k)) copies of ρ in order to achieve a constant multiplicative error. This directly translates to an additive-error estimator of quantum Renyi entropy of order k with the same number of copies. Finally, we present numerical evidence that the sample complexity of spectrum estimation can only improve over full state tomography by a sub-polynomial factor. Specifically, for spectrum learning with fully entangled measurements, we run simulations which suggest a lower bound of Ω(d^(2 - γ)) copies for any constant γ> 0. From this, we conclude the current best lower bound of Ω(d) is likely not tight.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections