New Quantum Algorithms for Computing Quantum Entropies and Distances

We propose a series of quantum algorithms for computing a wide range of quantum entropies and distances, including the von Neumann entropy, quantum Rényi entropy, trace distance, and fidelity. The proposed algorithms significantly outperform the prior best (and even quantum) ones in the low-rank case, some of which achieve exponential speedups. In particular, for N-dimensional quantum states of rank r, our proposed quantum algorithms for computing the von Neumann entropy, trace distance and fidelity within additive error
$\varepsilon $
have time complexity of
$\tilde {O}(r/\varepsilon ^{2})$
,
$\tilde {O}(r^{5}/\varepsilon ^{6})$
and
$\tilde {O}(r^{6.5}/\varepsilon ^{7.5})$
, respectively. By contrast, prior quantum algorithms for the von Neumann entropy and trace distance usually have time complexity
$\Omega (N)$
, and the prior best one for fidelity has time complexity
$\tilde {O}(r^{12.5}/\varepsilon ^{13.5})$
. The key idea of our quantum algorithms is to extend block-encoding from unitary operators in previous work to quantum states (i.e., density operators). It is realized by developing several convenient techniques to manipulate quantum states and extract information from them. The advantage of our techniques over the existing methods is that no restrictions on density operators are required; in sharp contrast, the previous methods usually require a lower bound on the minimal non-zero eigenvalue of density operators.