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:1001.4666 · Physical Review A

Comment on “Uncertainty relations in terms of the Tsallis entropy”

Iwo Białynicki‐Birula, Łukasz Rudnicki

Published Feb 9, 2010• 11 citations
arXivHTMLPDF

Abstract

We prove that the inequality used recently by Wilk and W\l{}odarczyk [Phys. Rev. A 79, 062108 (2009)] to find a better lower bound in the uncertainty relations for the R'enyi entropies is invalid. Thus, the problem of improving the bound given in our article [Phys. Rev. A 74, 052101 (2006)] remains unsolved.
DOI
10.1103/physreva.81.026101

Related papers

Improved bounds on entropic uncertainty relations

Julio I. de Vicente, Jorge Sánchez-Ruiz

Entropic uncertainty relations place nontrivial lower bounds to the sum of Shannon information entropies for noncommuting observables. Here we obtain a lower bound on the entropy sum for general pairs of observables in finite-dimensional Hilbert space, which improves on the best bound known to date [H. Maassen and J. B. M. Uffink, Phys. Rev. Lett. 60, 1103 (1988)] for a wide class of observables. This result follows from another formulation of the uncertainty principle, the Landau-Pollak inequality, whose relationship to the Maassen-Uffink entropic uncertainty relation is discussed.

arXiv:0709.1438•Physical Review A•Apr 16, 2008•71 citations

Uncertainty relations in terms of the Tsallis entropy

Grzegorz Andrzej Wilk, Z. Włodarczyk

Uncertainty relations emerging from the Tsallis entropy are derived and discussed. In particular we found a positively defined function that saturates the so-called entropic inequalities for entropies characterizing the physical states under consideration.

arXiv:0806.1660•Physical Review A•Jun 17, 2009•38 citations

Comment on “Improved bounds on entropic uncertainty relations”

G. M. Bosyk, M. Portesi, Angelo Plastino +1 more

We provide an analytical proof of the entropic uncertainty relations presented by J. I. de Vicente and J. S\'anchez-Ruiz [Phys. Rev. A 77, 042110 (2008)] and also show that the replacement of Eq. (27) by Eq. (29) in that reference introduces solutions that do not take fully into account the constraints of the problem, which in turn lead to some mistakes in their treatment.

arXiv:1112.5967•Physical Review A•Nov 18, 2011•21 citations

Formulation of the uncertainty relations in terms of the Rényi entropies

Iwo Białynicki‐Birula

Quantum-mechanical uncertainty relations for position and momentum are expressed in the form of inequalities involving the R\'enyi entropies. The proof of these inequalities requires the use of the exact expression for the $(p,q)$-norm of the Fourier transformation derived by Babenko and Beckner. Analogous uncertainty relations are derived for angle and angular momentum and also for a pair of complementary observables in $N$-level systems. All these uncertainty relations become more attractive when expressed in terms of the symmetrized R\'enyi entropies.

arXiv:quant-ph/0608116•Physical Review A•Nov 1, 2006•273 citations

Uncertainty relations for arbitrary measurement in terms of Renyi entropies

Alexey E. Rastegin

Uncertainty relations for a pair of arbitrary measurements and for a single measurement are posed in the form of inequalities using the Renyi entropies. The formulation deals with discrete observables. Both the relations with state-dependent and state-independent bounds are presented. The entropic bounds are illustrated within the distinction between non-orthogonal states.

arXiv:0805.1777•May 13, 2008•6 citations

Computational hardness of estimating quantum entropies via binary entropy bounds

Yupan Liu

We investigate the computational hardness of estimating the quantum $α$-Rényi entropy ${\rm S}^{\tt R}_α(ρ) = \frac{\ln {\rm Tr}(ρ^α)}{1-α}$ and the quantum $q$-Tsallis entropy ${\rm S}^{\tt T}_q(ρ) = \frac{1-{\rm Tr}(ρ^q)}{q-1}$, both of which converge to the von Neumann entropy as the order approaches $1$. The promise problems Quantum $α$-Rényi Entropy Approximation (RényiQEA$_α$) and Quantum $q$-Tsallis Entropy Approximation (TsallisQEA$_q$) ask whether $ {\rm S}^ {\tt R}_α(ρ)$ or ${\rm S}^{\tt T}_q(ρ)$, is at least $τ_1$ or at most $τ_2$, where $τ_1 - τ_2$ is typically a positive constant. Previous hardness results cover only the von Neumann entropy (order $1$) and some cases of the quantum $q$-Tsallis entropy, while existing approaches do not readily extend to other orders. We establish that for all positive real $α$ and $q$, and also for $α=\infty$, the rank-$2$ variants Rank2RényiQEA$_α$ and Rank2TsallisQEA$_q$ are BQP-hard. Combined with prior (rank-dependent) quantum query algorithms in Wang, Guan, Liu, Zhang, and Ying (TIT 2024), Wang, Zhang, and Li (TIT 2024), and Liu and Wang (SODA 2025), as well as the one derived from O'Donnell and Wright (STOC 2016), our results imply: - For all real orders $α> 0$ or $α=\infty$, and for all real orders $0 < q \leq 1$, LowRankRényiQEA$_α$ and LowRankTsallisQEA$_q$ are BQP-complete, where both are restricted versions of RényiQEA$_α$ and TsallisQEA$_q$ with $ρ$ of polynomial rank. - For all real order $q>1$, TsallisQEA$_q$ is BQP-complete. Our hardness results stem from reductions based on new inequalities relating the $α$-Rényi or $q$-Tsallis binary entropies of different orders. These reductions differ substantially from previous approaches, and the inequalities are of independent interest.

quant-pharXiv:2601.03734•Leibniz international proceedings in informatics•Jan 8, 2026•0 citations
Entropic uncertainty relations place nontrivial lower bounds to the sum of Shannon information entropies for noncommuting observables. Here we obtain a lower bound on the entropy sum for general pairs of observables in finite-dimensional Hilbert space, which improves on the best bound known to date [H. Maassen and J. B. M. Uffink, Phys. Rev. Lett. 60, 1103 (1988)] for a wide class of observables. This result follows from another formulation of the uncertainty principle, the Landau-Pollak inequality, whose relationship to the Maassen-Uffink entropic uncertainty relation is discussed.
Quantum-mechanical uncertainty relations for position and momentum are expressed in the form of inequalities involving the R\'enyi entropies. The proof of these inequalities requires the use of the exact expression for the (p,q)(p,q)(p,q)-norm of the Fourier transformation derived by Babenko and Beckner. Analogous uncertainty relations are derived for angle and angular momentum and also for a pair of complementary observables in NNN-level systems. All these uncertainty relations become more attractive when expressed in terms of the symmetrized R\'enyi entropies.
We investigate the computational hardness of estimating the quantum ααα-Rényi entropy SαR(ρ)=ln⁡Tr(ρα)1−α{\rm S}^{\tt R}_α(ρ) = \frac{\ln {\rm Tr}(ρ^α)}{1-α}SαR​(ρ)=1−αlnTr(ρα)​ and the quantum qqq-Tsallis entropy SqT(ρ)=1−Tr(ρq)q−1{\rm S}^{\tt T}_q(ρ) = \frac{1-{\rm Tr}(ρ^q)}{q-1}SqT​(ρ)=q−11−Tr(ρq)​, both of which converge to the von Neumann entropy as the order approaches 111. The promise problems Quantum ααα-Rényi Entropy Approximation (RényiQEAα_αα​) and Quantum qqq-Tsallis Entropy Approximation (TsallisQEAq_qq​) ask whether $ {\rm S}^ {\tt R}_α(ρ)$ or SqT(ρ){\rm S}^{\tt T}_q(ρ)SqT​(ρ), is at least τ1τ_1τ1​ or at most τ2τ_2τ2​, where τ1−τ2τ_1 - τ_2τ1​−τ2​ is typically a positive constant. Previous hardness results cover only the von Neumann entropy (order 111) and some cases of the quantum qqq-Tsallis entropy, while existing approaches do not readily extend to other orders. We establish that for all positive real ααα and qqq, and also for α=∞α=\inftyα=∞, the rank-222 variants Rank2RényiQEAα_αα​ and Rank2TsallisQEAq_qq​ are BQP-hard. Combined with prior (rank-dependent) quantum query algorithms in Wang, Guan, Liu, Zhang, and Ying (TIT 2024), Wang, Zhang, and Li (TIT 2024), and Liu and Wang (SODA 2025), as well as the one derived from O'Donnell and Wright (STOC 2016), our results imply: - For all real orders α>0α> 0α>0 or α=∞α=\inftyα=∞, and for all real orders 0<q≤10 < q \leq 10<q≤1, LowRankRényiQEAα_αα​ and LowRankTsallisQEAq_qq​ are BQP-complete, where both are restricted versions of RényiQEAα_αα​ and TsallisQEAq_qq​ with ρρρ of polynomial rank. - For all real order q>1q>1q>1, TsallisQEAq_qq​ is BQP-complete. Our hardness results stem from reductions based on new inequalities relating the ααα-Rényi or qqq-Tsallis binary entropies of different orders. These reductions differ substantially from previous approaches, and the inequalities are of independent interest.