New Quantum Algorithms for Computing Quantum Entropies and Distances

03/25/2022
by   Qisheng Wang, et al.
0

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 best known (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 ε have time complexity of Õ(r^2/ε^2), Õ(r^5/ε^6) and Õ(r^6.5/ε^7.5), respectively. In contrast, the known algorithms for the von Neumann entropy and trace distance require quantum time complexity of Ω(N) [AISW19,GL20,GHS21], and the best known one for fidelity requires Õ(r^21.5/ε^23.5) [WZC+21]. 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. In particular, we introduce a novel technique for eigenvalue transformation of density operators and their (non-integer) positive powers, based on the powerful quantum singular value transformation (QSVT) [GSLW19]. 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 of the minimal non-zero eigenvalue of density operators. In addition, we provide some techniques of independent interest for trace estimation, linear combinations, and eigenvalue threshold projectors of (subnormalized) density operators, which will be, we believe, useful in other quantum algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2020

Variational Quantum Algorithms for Trace Distance and Fidelity Estimation

Estimating the difference between quantum data is crucial in quantum com...
research
06/10/2021

Perturbation Theory for Quantum Information

We report lowest-order series expansions for primary matrix functions of...
research
12/03/2022

A Unified Quantum Algorithm Framework for Estimating Properties of Discrete Probability Distributions

Estimating statistical properties is fundamental in statistics and compu...
research
08/09/2023

Space-bounded quantum state testing via space-efficient quantum singular value transformation

Driven by exploring the power of quantum computation with a limited numb...
research
01/13/2021

An Algebraic Method to Fidelity-based Model Checking over Quantum Markov Chains

Fidelity is one of the most widely used quantities in quantum informatio...
research
04/15/2016

Estimation of low rank density matrices: bounds in Schatten norms and other distances

Let S_m be the set of all m× m density matrices (Hermitian positively s...
research
06/27/2022

Positive-definite parametrization of mixed quantum states with deep neural networks

We introduce the Gram-Hadamard Density Operator (GHDO), a new deep neura...

Please sign up or login with your details

Forgot password? Click here to reset