Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0305062 · Open Systems & Information Dynamics

Rényi Extrapolation of Shannon Entropy

Karol Życzkowski

Published Sep 1, 2003• 185 citations
arXivHTMLPDF

Abstract

Relations between Shannon entropy and Rényi entropies of integer order are discussed. For any N-point discrete probability distribution for which the Rényi entropies of order two and three are known, we provide a lower and an upper bound for the Shannon entropy. The average of both bounds provide an explicit extrapolation for this quantity. These results imply relations between the von Neumann entropy of a mixed quantum state, its linear entropy and traces.

DOI
10.1023/a:1025128024427

Related papers

The structure of Rényi entropic inequalities

Noah Linden, Milán Mosonyi, Andreas Winter

We investigate the universal inequalities relating the α -Rényi entropies of the marginals of a multi-partite quantum state. This is in analogy to the same question for the Shannon and von Neumann entropies ( α =1), which are known to satisfy several non-trivial inequalities such as strong subadditivity. Somewhat surprisingly, we find for 0< α <1 that the only inequality is non-negativity: in other words, any collection of non-negative numbers assigned to the non-empty subsets of n parties can be arbitrarily well approximated by the α -entropies of the 2 n −1 marginals of a quantum state. For α >1, we show analogously that there are no non-trivial homogeneous (in particular, no linear) inequalities. On the other hand, it is known that there are further, nonlinear and indeed non-homogeneous, inequalities delimiting the α -entropies of a general quantum state. Finally, we also treat the case of Rényi entropies restricted to classical states (i.e. probability distributions), which, in addition to non-negativity, are also subject to monotonicity. For α ≠0,1, we show that this is the only other homogeneous relation.

arXiv:1212.0248•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Aug 21, 2013•90 citations

Connecting the von Neumann and Rényi entropies for fermions

M. Fannes, Nicholas Van Ryn

We explore the relation between the von Neumann entropy and the Rényi entropies of integer orders for shift-invariant quasi-free fermionic lattice systems. We investigate the approximation of the von Neumann entropy by a combination of integer-order Rényi entropies and give an estimate for the quality of such an approximation.

arXiv:1205.0945•Journal of Physics A Mathematical and Theoretical•Sep 5, 2012•9 citations

On the relation between the shannon entropy and the von neumann entropy

Siu‐Wai Ho, Raymond W. Yeung

This paper presents three approaches to explore the relation between the Shannon entropy and the von Neumann entropy. The first two approaches are based on the measurement of the quantum state, while the third approach is based on the preparation of the quantum state. Each of these approaches leads to an alternative definition of the von Neumann entropy.

IEEE International Symposium on Information Theory (ISIT)•Dec 23, 2004•2 citations

Improved Quantum Algorithms for Rényi Entropies Estimation

Zongxing Xiong, Chengshen Gao, Lvzhou Li

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ényi entropy $H_α(\mathbf{p})$ for any distribution $\mathbf{p} = (p_i)_{i=1}^n$ given its purified quantum query-access. For non-integer $α> 1$, our algorithm estimates $H_α(\mathbf{p})$ to within additive error $ε$ using only $\widetilde{\mathcal{O}}\big(n^{\max\{1/2,1-1/α\}}/ε\big)$ queries, which improves the best known upper bound for dependence on both $n$ and $1/ε$. For $0<α<1$, our algorithm has query complexity $\widetilde{\mathcal{O}}\big(n^{1/(2α)}/ε^{\max\{1,1/(2α)\}}\big)$, which improves the dependence on $1/ε$ of the current best upper bound without incresing its $n$ dependence. Our approach adapts the multi-level estimation framework to relative approximation of the power sums and leverage binary search to remove the requirement of prior knowledge of them. We also strengthen the precision-dependent lower bound to $Ω\big(1/ε^{\max\{1,1/(2α)\}}\big)$ for $0<α<1$, which identifies the optimal precision dependence of our algorithm.

quant-pharXiv:2610.19936•Oct 15, 2026•0 citations

Upper bounds on Shannon and Rényi entropies for central potentials

Pablo Sánchez-Moreno, Steeve Zozor, J. S. Dehesa

The Rényi and Shannon entropies are information-theoretic measures, which have enabled to formulate the position–momentum uncertainty principle in a much more adequate and stringent way than the (variance-based) Heisenberg-like relation. Moreover, they are closely related to various energetic density functionals of quantum systems. Here we derive upper bounds on these quantities in terms of the second-order moment 〈r2〉 for general central potentials. This improves previous results of this type. The proof uses the Rényi maximization procedure with a covariance constraint due to Costa et al. [in Proceedings of the Fourth International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), edited by A. Rangarajan, M. A. T. Figueiredo, and J. Zerubia (Springer-Verlag, Lisbon, 2003), [Lect. Notes Comput. Sci. 52, 211 (2003).]] The contributions to these bounds coming from the radial and angular parts of the physical wave functions are taken into account. Finally, the application to the d-dimensional (d ⩾ 3) hydrogenic and oscillator-like systems is provided.

Journal of Mathematical Physics•Feb 1, 2011•32 citations

Some applications of matrix inequalities in Rényi entropy

Hadi Reisizadeh, Seyed Mahmoud Manjegani

The R{é}nyi entropy is one of the important information measures that generalizes Shannon's entropy. The quantum R{é}nyi entropy has a fundamental role in quantum information theory, therefore, bounding this quantity is of vital importance. Another important quantity is R{é}nyi relative entropy on which R{é}nyi generalization of the conditional entropy, and mutual information are defined based. Thus, finding lower bound for R{é}nyi relative entropy is our goal in this paper. We use matrix inequalities to prove new bounds on the entropy of type $β$, R{é}nyi entropy.

arXiv:1608.03362•Aug 11, 2016•1 citation
Relations between Shannon entropy and Rényi entropies of integer order are discussed. For any N-point discrete probability distribution for which the Rényi entropies of order two and three are known, we provide a lower and an upper bound for the Shannon entropy. The average of both bounds provide an explicit extrapolation for this quantity. These results imply relations between the von Neumann entropy of a mixed quantum state, its linear entropy and traces.
We investigate the universal inequalities relating the α -Rényi entropies of the marginals of a multi-partite quantum state. This is in analogy to the same question for the Shannon and von Neumann entropies ( α =1), which are known to satisfy several non-trivial inequalities such as strong subadditivity. Somewhat surprisingly, we find for 0< α <1 that the only inequality is non-negativity: in other words, any collection of non-negative numbers assigned to the non-empty subsets of n parties can be arbitrarily well approximated by the α -entropies of the 2 n −1 marginals of a quantum state. For α >1, we show analogously that there are no non-trivial homogeneous (in particular, no linear) inequalities. On the other hand, it is known that there are further, nonlinear and indeed non-homogeneous, inequalities delimiting the α -entropies of a general quantum state. Finally, we also treat the case of Rényi entropies restricted to classical states (i.e. probability distributions), which, in addition to non-negativity, are also subject to monotonicity. For α ≠0,1, we show that this is the only other homogeneous relation.
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ényi entropy Hα(p)H_α(\mathbf{p})Hα​(p) for any distribution p=(pi)i=1n\mathbf{p} = (p_i)_{i=1}^np=(pi​)i=1n​ given its purified quantum query-access. For non-integer α>1α> 1α>1, our algorithm estimates Hα(p)H_α(\mathbf{p})Hα​(p) to within additive error εεε using only O~(nmax⁡{1/2,1−1/α}/ε)\widetilde{\mathcal{O}}\big(n^{\max\{1/2,1-1/α\}}/ε\big)O(nmax{1/2,1−1/α}/ε) queries, which improves the best known upper bound for dependence on both nnn and 1/ε1/ε1/ε. For 0<α<10<α<10<α<1, our algorithm has query complexity O~(n1/(2α)/εmax⁡{1,1/(2α)})\widetilde{\mathcal{O}}\big(n^{1/(2α)}/ε^{\max\{1,1/(2α)\}}\big)O(n1/(2α)/εmax{1,1/(2α)}), which improves the dependence on 1/ε1/ε1/ε of the current best upper bound without incresing its nnn dependence. Our approach adapts the multi-level estimation framework to relative approximation of the power sums and leverage binary search to remove the requirement of prior knowledge of them. We also strengthen the precision-dependent lower bound to Ω(1/εmax⁡{1,1/(2α)})Ω\big(1/ε^{\max\{1,1/(2α)\}}\big)Ω(1/εmax{1,1/(2α)}) for 0<α<10<α<10<α<1, which identifies the optimal precision dependence of our algorithm.
The Rényi and Shannon entropies are information-theoretic measures, which have enabled to formulate the position–momentum uncertainty principle in a much more adequate and stringent way than the (variance-based) Heisenberg-like relation. Moreover, they are closely related to various energetic density functionals of quantum systems. Here we derive upper bounds on these quantities in terms of the second-order moment 〈r2〉 for general central potentials. This improves previous results of this type. The proof uses the Rényi maximization procedure with a covariance constraint due to Costa et al. [in Proceedings of the Fourth International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), edited by A. Rangarajan, M. A. T. Figueiredo, and J. Zerubia (Springer-Verlag, Lisbon, 2003), [Lect. Notes Comput. Sci. 52, 211 (2003).]] The contributions to these bounds coming from the radial and angular parts of the physical wave functions are taken into account. Finally, the application to the d-dimensional (d ⩾ 3) hydrogenic and oscillator-like systems is provided.
The R{é}nyi entropy is one of the important information measures that generalizes Shannon's entropy. The quantum R{é}nyi entropy has a fundamental role in quantum information theory, therefore, bounding this quantity is of vital importance. Another important quantity is R{é}nyi relative entropy on which R{é}nyi generalization of the conditional entropy, and mutual information are defined based. Thus, finding lower bound for R{é}nyi relative entropy is our goal in this paper. We use matrix inequalities to prove new bounds on the entropy of type βββ, R{é}nyi entropy.