Paper detail

Quantum Spectrum Testing

In this work, we study the problem of testing properties of the spectrum of a mixed quantum state. Here one is given $n$ copies of a mixed state $ρ\in\mathbb{C}^{d\times d}$ and the goal is to distinguish whether $ρ$'s spectrum satisfies some property $\mathcal{P}$ or is at least $ε$-far in $\ell_1$-distance from satisfying $\mathcal{P}$. This problem was promoted in the survey of Montanaro and de Wolf under the name of testing unitarily invariant properties of mixed states. It is the natural quantum analogue of the classical problem of testing symmetric properties of probability distributions. Here, the hope is for algorithms with subquadratic copy complexity in the dimension $d$. This is because the "empirical Young diagram (EYD) algorithm" can estimate the spectrum of a mixed state up to $ε$-accuracy using only $\widetilde{O}(d^2/ε^2)$ copies. In this work, we show that given a mixed state $ρ\in\mathbb{C}^{d\times d}$: (i) $Θ(d/ε^2)$ copies are necessary and sufficient to test whether $ρ$ is the maximally mixed state, i.e., has spectrum $(\frac1d, ..., \frac1d)$; (ii) $Θ(r^2/ε)$ copies are necessary and sufficient to test with one-sided error whether $ρ$ has rank $r$, i.e., has at most $r$ nonzero eigenvalues; (iii) $\widetildeΘ(r^2/Δ)$ copies are necessary and sufficient to distinguish whether $ρ$ is maximally mixed on an $r$-dimensional or an $(r+Δ)$-dimensional subspace; and (iv) The EYD algorithm requires $Ω(d^2/ε^2)$ copies to estimate the spectrum of $ρ$ up to $ε$-accuracy, nearly matching the known upper bound. In addition, we simplify part of the proof of the upper bound. Our techniques involve the asymptotic representation theory of the symmetric group; in particular Kerov's algebra of polynomial functions on Young diagrams.