Entropy estimation of discrete probability distributions is a fundamental problem in statistical inference and quantum property estimation. In this paper, we study the problem of estimating R\'enyi entropy $H_\alpha(\mathbf{p})$ for any distribution $\mathbf{p} = (p_i)_{i=1}^n$ given its purified quantum query-access....
An upper bound of $\tilde{O}\!\big(\frac{\rho}}{\Delta\epsilon}+\frac{1}{\Delta\sqrt{\epsilon}}\big)$ queries is proved for quantum counting with bounded-error oracles, achieving a quadratic speedup over the classical sample complexity.
This work designs quantum algorithms with complexities $\tilde{O}(1/\epsilon)$ and $\tilde{O}(\sqrt{m}/\epsilon)$ in the query and sampling models, respectively, achieving quadratic speedups over the classical counterparts.
Chen Gao, Yong-Zhen Xu, Shenggen Zheng et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.