In this work, we consider the fundamental task of estimating the purity of an unknown state to within $\textit{multiplicative}$ error $\varepsilon$. When one can perform general collective measurements, $\Theta\left(\frac{\sqrt{d}}{\varepsilon^2} + \frac{d}{\varepsilon}\right)$ copies are known to be necessary and suff...
It is demonstrated that shared randomness is necessary to achieve the complexity of distributed state certification with limited communication, and an $\Omega$ lower bound in the $\textit{private-coin}$ setting is proved.
Kenny Chen, Mina Doosti, R. Sweke et al.· 1 citation
We study the sample complexity of estimating and testing fundamental unitarily invariant properties of unknown quantum states; namely, the tasks of spectrum estimation, von Neumann entropy estimation, and rank-testing. For $d$-dimensional states, and for every $\gamma>0$, we prove a sample complexity lower bound of $\O...
Marco Fanizza, Ryan O'Donnell, Chirag Wadhwa· arXiv.org· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.