Time-Efficient Quantum Entropy Estimator via Samplizer

Abstract

Entropy is a measure of the randomness of a system. Estimating the entropy of a quantum state is a basic problem in quantum information. In this paper, we introduce a time-efficient quantum approach to estimating the von Neumann entropy $S(\rho )$ and Rényi entropy $S_{\alpha }(\rho )$ of an $N$-dimensional quantum state $\rho$, given access to independent samples of $\rho$. Specifically, we provide the following: 1. A quantum estimator for $S(\rho )$ with time complexity $\tilde{O}(N^2)$, improving the prior best time complexity $\tilde{O}(N^6)$ by Acharya, Issa, Shende, and Wagner (2020) and Bavarian, Mehraba, and Wright (2016). 2. A quantum estimator for $S_{\alpha }(\rho )$ with time complexity $\tilde{O}(N^{4/\alpha -2})$ for $0<\alpha <1$ and $\tilde{O}(N^{4-2/\alpha })$ for $\alpha >1$, improving the prior best time complexity $\tilde{O}(N^{6/\alpha })$ for $0<\alpha <1$ and $\tilde{O}(N^6)$ for $\alpha >1$ by Acharya, Issa, Shende, and Wagner (2020), though at a cost of a slightly larger sample complexity. Moreover, these estimators are naturally extensible to the low-rank case. We also provide a sample lower bound for estimating $S_{\alpha }(\rho )$. Technically, our method is quite different from the previous ones that are based on weak Schur sampling and Young diagrams. At the heart of our construction, is a novel tool called samplizer, which can "samplize" a quantum query algorithm to a quantum algorithm with similar behavior using only samples of quantum states; this suggests a unified framework for estimating quantum entropies. Specifically, when a quantum oracle $U$ block-encodes a mixed quantum state $\rho$, any quantum query algorithm using $Q$ queries to $U$ can be samplized to a $\delta$-close (in the diamond norm) quantum algorithm using $\tilde{\Theta }(Q^2/\delta )$ samples of $\rho$. Moreover, this samplization is proven to be optimal, up to a polylogarithmic factor.

Final version. 60 pages, 1 table, 13 algorithms, 5 figures. Minor corrections and more discussions. [v2]: Minor modification on the definition of samplizer

References in corpus (34)

• Quantum entanglement
• Quantum algorithm for solving linear systems of equations
• Quantum principal component analysis
• Quantum fingerprinting
• Measuring entanglement entropy through the interference of quantum many-body twins
• Hamiltonian Simulation by Qubitization
• Quantum entanglement in condensed matter systems
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• From Classical to Quantum Shannon Theory
• Measuring Renyi Entanglement Entropy with Quantum Monte Carlo
• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• Estimating the spectrum of a density operator
• Variational Thermal Quantum Simulation via Thermofield Double States
• Sample-efficient learning of quantum many-body systems
• Renyi Entropy of the XY Spin Chain
• Does Dirichlet Prior Smoothing Solve the Shannon Entropy Estimation Problem?
• Maximum Likelihood Estimation of Functionals of Discrete Distributions
• Hamiltonian Simulation with Optimal Sample Complexity
• Quantum algorithm for estimating Renyi entropies of quantum states
• Quantum Algorithm for Fidelity Estimation
• An efficient high dimensional quantum Schur transform
• Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem
• Measuring Quantum Entropy
• New Quantum Algorithms for Computing Quantum Entropies and Distances
• Quantum algorithms for estimating quantum entropies
• Fast Quantum Algorithms for Trace Distance Estimation
• Optimal Trace Distance and Fidelity Estimations for Pure Quantum States
• Unconditionally secure quantum commitments with preprocessing
• Quantum algorithms for matrix geometric means
• A Quantum Algorithm Framework for Discrete Probability Distributions with Applications to Rényi Entropy Estimation
• Sample-based Hamiltonian and Lindbladian simulation: Non-asymptotic analysis of sample complexity
• Lower Bounds for Unitary Property Testing with Proofs and Advice
• Measuring quantum relative entropy with finite-size effect
• Quantum Lower Bounds by Sample-to-Query Lifting

Cited by in corpus (3)

• Quantum algorithms for matrix geometric means
• Performance Guarantees for Quantum Neural Estimation of Entropies
• Singular value transformation for unknown quantum channels