Quantum algorithms for estimating quantum entropies
Youle Wang, Benchi Zhao, Xin Wang

TL;DR
This paper introduces practical quantum algorithms for estimating von Neumann and Renyi entropies of quantum states using multiple copies, avoiding complex query models, with proven efficiency and experimental validation.
Contribution
It presents novel quantum algorithms that estimate quantum entropies directly from state copies, improving practicality over previous query-based methods.
Findings
Algorithms require polynomially many copies in 1/epsilon and 1/Lambda.
No need for quantum query oracles, enhancing practicality.
Experimental results demonstrate effectiveness and noise robustness.
Abstract
The von Neumann and quantum R\'enyi entropies characterize fundamental properties of quantum systems and lead to theoretical and practical applications in many fields. Quantum algorithms for estimating quantum entropies, using a quantum query model that prepares the purification of the input state, have been established in the literature. {However, constructing such a model is almost as hard as state tomography.} In this paper, we propose quantum algorithms to estimate the von Neumann and quantum -R\'enyi entropies of an -qubit quantum state using independent copies of the input state. We also show how to efficiently construct the quantum circuits for {quantum entropy estimation} using primitive single/two-qubit gates. We prove that the number of required copies scales polynomially in and , where denotes the additive precision and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Machine Learning and Algorithms
