Optimal spectrum estimation

We prove that the spectrum of an unknown $d$-dimensional quantum state can be estimated to error $\varepsilon$ in total variation distance using [ O!\left(d^2\min\left{ \frac{1}{(\varepsilon\log d)^4},; \frac{1}{(\varepsilon\log d)^2} \right}\right) ] copies. This matches the recent lower bound of Wang. When restricted to unentangled measurements, we give an algorithm with an additional factor of $d$ in copy complexity, which we conjecture to be optimal. We develop a framework for recovering the small eigenvalues of a quantum state by matching Chebyshev moments. We bound the variance of each Chebyshev moment estimate in terms of scalar derivatives of the corresponding polynomial, using classical and quantum Efron--Stein decompositions. Different rescalings of the Chebyshev polynomials balance approximation error and variance, yielding two regimes in our copy complexity bound.

Source: arXiv:2609.30171v1 - http://arxiv.org/abs/2609.30171v1 PDF: https://arxiv.org/pdf/2609.30171v1 Original Link: http://arxiv.org/abs/2609.30171v1