A Quantum Algorithm Framework for Discrete Probability Distributions with Applications to Rényi Entropy Estimation
arXiv:2212.01571 · doi:10.1109/TIT.2024.3382037
Abstract
Estimating statistical properties is fundamental in statistics and computer science. In this paper, we propose a unified quantum algorithm framework for estimating properties of discrete probability distributions, with estimating Rényi entropies as specific examples. In particular, given a quantum oracle that prepares an -dimensional quantum state , for and , our algorithm framework estimates -Rényi entropy to within additive error with probability at least using and queries, respectively. This improves the best known dependence in as well as the joint dependence between and . Technically, our quantum algorithms combine quantum singular value transformation, quantum annealing, and variable-time amplitude estimation. We believe that our algorithm framework is of general interest and has wide applications.
to be published in IEEE Transactions on Information Theory
References in corpus (7)
- Quantum algorithm for solving linear systems of equations
- Fixed-point quantum search with an optimal number of queries
- A Variational Quantum Algorithm for Preparing Quantum Gibbs States
- Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem
- Quantum algorithms for estimating quantum entropies
- Fast Quantum Algorithms for Trace Distance Estimation
- Improved Quantum Algorithms for Fidelity Estimation
Cited by in corpus (5)
- New Quantum Algorithms for Computing Quantum Entropies and Distances
- Succinct quantum testers for closeness and -wise uniformity of probability distributions
- Time-Efficient Quantum Entropy Estimator via Samplizer
- Quantum Lower Bounds by Sample-to-Query Lifting
- Performance Guarantees for Quantum Neural Estimation of Entropies