Quantum algorithm for estimating $\alpha$-Renyi entropies of quantum states

We describe a quantum algorithm to estimate the $\alpha$-Renyi entropy of an unknown density matrix $\rho \in {\mathbb{C}}^{d\times d}$ for $\alpha \ne 1$ by combining the recent technique of quantum singular value transformations with the method of estimating normalized traces in the one clean qubit model. We consider an oracular input model where the input state is prepared via a quantum oracle that outputs a purified version of the state, assumed to be nonsingular. Our method outputs an estimate of the $\alpha$-Renyi entropy to additive precision $\epsilon$, using an expected total number $O\left(\frac{1}{{\left(x\epsilon \right)}^2}\right)$ of independent applications of a quantum circuit which coherently queries the input unitary $O(\frac{1}{\delta }log\frac{d}{\epsilon })$ times, in each case measuring a single output qubit. Here $\delta$ is a lower cutoff on the smallest eigenvalue of $\rho$ and $x=\frac{1}{d}\mathrm{Tr}\left({\rho }^{\alpha }\right)$. The expected number of measurements made in this method can be compared to results in the sample complexity model that generally require $\mathrm{\Theta }\left(\frac{d^2}{{\epsilon }^2}\right)$ samples. Furthermore, we also show that multiplicative approximations can be obtained by iteratively using additive approximations, with an overhead logarithmic in the dimension $d$.

Figure 1

A $\mathsf{DQC}\mathsf{1}$ circuit that can be used to estimate $\frac{1}{2^n}\mathrm{Tr}\left(U\right)$, for which no classical efficient algorithm is known. Measurements are made in the computational basis.