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:2605.01832

Tight Entropic Uncertainty Relations

Alberto Riccardi, Lorenzo Maccone

quant-phSubmitted May 3, 2026• Announced May 5, 2026• 0 citations• Revised Jul 2, 2026 (v2)
v1 · May 3, 2026v2 · Jul 2, 2026
arXivHTMLPDF

Abstract

Entropic uncertainty relations $H(A)+H(B)\geqslant γ$ give a nonzero lower bound $γ$ to the sum of the Shannon entropies $H$ of the outcome probabilities of incompatible observables $A$ and $B$. They are better than the variance-based uncertainty relations because they only depend on the Born statistics of the outcomes and not on the outcomes themselves, and because bounds $γ$ typically are state independent. Here we provide a state-independent lower bound $γ_s$ that is better than the textbook Maassen-Uffink bound and, in the limit of the parameter $s\to 2$, becomes asymptotically tight for all $A,B$. The bound can be extended to Renyi entropies. After the submission of this paper, we found out that the main results presented here were already on page 6 of https://quantum-journal.org/papers/q-2018-03-30-59/pdf/

AI Summary

The paper considers state-independent lower bounds on the sum of outcome entropies for two projective measurements with overlap matrix $U_{ji}=\langle b_j|a_i\rangle$. It expresses these bounds using induced operator norms that depend on the full overlap matrix, rather than only its largest entry. For $1<s<2$ and $s'=s/(s-1)$, it establishes $H(A)+H(B)\geq\gamma_s$, where $\gamma_s=-\frac{2s}{2-s}\log_2\|U\|_{s\to s'}$. This is at least the Maassen–Uffink bound $-2\log_2\max_{ij}|U_{ji}|$, and $\gamma_s$ converges to the minimum possible Shannon-entropy sum as $s\to2^-$. The same expression is the exact minimum of $H_{s/2}(A)+H_{s'/2}(B)$ for each $s$. The Shannon bound follows from Riesz–Thorin interpolation and differentiation at the Hilbert-space norm; the Rényi statement follows directly from the induced-norm definition. Numerical evaluation uses nonlinear power iteration with multiple random initializations. The paper explicitly notes that this procedure can converge to local maxima, so finding the global norm requires repeated starts rather than a supplied certificate. It also gives a qubit reduction to a one-variable minimization, with a closed expression in one angular regime and numerical minimization otherwise. The discussion treats pure states and states that the bounds extend to mixed states. An addendum in the abstract states that the main results already appeared on page 6 of a 2018 *Quantum* paper linked there.

No sign of AI-generated textUnclear noveltyOverclaimsPossible error

Error found: The tightness proof exchanges a limit and an infimum without supplying the uniform-convergence argument that justifies this step in finite dimension. The claimed efficient numerical evaluation is unsupported by the local-search NPIM procedure, whose underestimated operator norm yields an uncertified overestimate of the theoretical entropy lower bound. The qubit appendix incorrectly calls the second derivative negative below the critical angle, although its displayed formula gives the positive sign consistent with a local minimum.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
We were scooped. The main results of this paper had appeared previously in a paper by Rene Schwonnek, unbeknownst to us. Rene gracefully pointed it out to us

Related papers

An entropic uncertainty principle for mixed states

Antonio F. Rotundo, René Schwonnek

The entropic uncertainty principle in the form proven by Maassen and Uffink yields a fundamental inequality that is prominently used in many places all over the field of quantum information theory. In this work, we provide a family of versatile generalizations of this relation. Our proof methods build on a deep connection between entropic uncertainties and interpolation inequalities for the doubly stochastic map that links probability distributions in two measurements bases. In contrast to the original relation, our generalization also incorporates the von Neumann entropy of the underlying quantum state. These results can be directly used to bound the extractable randomness of a source independent QRNG in the presence of fully quantum attacks, to certify entanglement between trusted parties, or to bound the entanglement of a system with an untrusted environment.

arXiv:2303.11382•Mar 20, 2023•0 citations

Entropic uncertainty principle for mixed states

Antonio F. Rotundo, René Schwonnek

The entropic uncertainty principle in the form proven by Maassen and Uffink yields a fundamental inequality that is prominently used in many places all over the field of quantum information theory. In this paper, we provide a family of versatile generalizations of this relation. Our proof methods build on a deep connection between entropic uncertainties and interpolation inequalities for the doubly stochastic map that links probability distributions in two measurement bases. In contrast to the original relation, our generalization also incorporates the von Neumann entropy of the underlying quantum state. These results can be directly used to bound the extractable randomness of a source-independent quantum random number generator in the presence of fully quantum attacks, to certify entanglement between trusted parties, or to bound the entanglement of a system with an untrusted environment. Published by the American Physical Society 2024

Physical Review Research•Jul 9, 2024•2 citations

Entropic uncertainty principle for mixed states

Antonio F. Rotundo, René Schwonnek

The entropic uncertainty principle in the form proven by Maassen and Uffink yields a fundamental inequality that is prominently used in many places all over the field of quantum information theory. In this paper, we provide a family of versatile generalizations of this relation. Our proof methods build on a deep connection between entropic uncertainties and interpolation inequalities for the doubly stochastic map that links probability distributions in two measurement bases. In contrast to the original relation, our generalization also incorporates the von Neumann entropy of the underlying quantum state. These results can be directly used to bound the extractable randomness of a source-independent quantum random number generator in the presence of fully quantum attacks, to certify entanglement between trusted parties, or to bound the entanglement of a system with an untrusted environment.

•Jan 1, 2024•0 citations

Entropic uncertainty relations for multiple measurements assigned with biased weights

Shan Huang, Hua‐Lei Yin, Zeng‐Bing Chen +1 more

The entropic way of formulating Heisenberg's uncertainty principle not only plays a fundamental role in applications of quantum information theory but also is essential for manifesting genuine nonclassical features of quantum systems. In this paper we investigate Rényi entropic uncertainty relations (EURs) in the scenario where measurements on individual copies of a quantum system are selected with nonuniform probabilities. In contrast with EURs that characterize an observer's overall lack of information about outcomes with respect to a collection of measurements, we establish state-dependent lower bounds on the weighted sum of entropies over multiple measurements. Conventional EURs thus correspond to the special cases when all weights are equal, and in such cases we show our results are generally stronger than previous ones. Moreover, taking the entropic steering criterion as an example, we numerically verify that our EURs could be advantageous in practical quantum tasks by optimizing the weights assigned to different measurements. Importantly, this optimization does not require quantum resources and is efficiently computable on classical computers. Published by the American Physical Society 2024

arXiv:2309.16955•Physical Review Research•Jan 31, 2024•9 citations

Lower and upper bounds for unilateral coherence and applying them to the entropic uncertainty relations

Hazhir Dolatkhah, Soroush Haseli, S. Salimi +1 more

The uncertainty principle sets a bound on our ability to predict the measurement outcomes of two incompatible observables which are measured on a quantum particle simultaneously. In quantum information theory, the uncertainty principle can be formulated in terms of the Shannon entropy. Entropic uncertainty bound can be improved by adding a particle which correlates with the measured particle. The added particle acts as a quantum memory. In this work, a method is provided for obtaining the entropic uncertainty relations in the presence of a quantum memory by using quantum coherence. In the method, firstly, one can use the quantum relative entropy of quantum coherence to obtain the uncertainty relations. Secondly, these relations are applied to obtain the entropic uncertainty relations in the presence of a quantum memory. In comparison with other methods this approach is much simpler. Also, for a given state, the upper bounds on the sum of the relative entropies of unilateral coherences are provided, and it is shown which one is tighter. In addition, using the upper bound obtained for unilateral coherence, the nontrivial upper bound on the sum of the entropies for different observables is derived in the presence of a quantum memory.

arXiv:1912.00424•Dec 1, 2019•0 citations

Tighter generalized entropic uncertainty relations in multipartite systems

Lin Wu, Ye Liu, Dong Wang

The uncertainty principle, which demonstrates the intrinsic uncertainty of nature from an information-theory perspective, is at the heart of quantum information theory. In the realm of quantum information theory, Shannon entropy is used to depict the uncertainty relation in general. A tighter lower bound for uncertainty relations facilitates more accurate predictions of measurement outcomes and more robust quantum information processing. Interestingly, the tripartite entropic uncertainty relation (EUR) can be further optimized. Renes et al. proposed a tripartite EUR [J. M. Renes and J.-C. Boileau, Phys. Rev. Lett. 103, 020402 (2009)], and subsequently, Ming et al. strengthened its lower bound in [F. Ming, D. Wang, X.-G. Fan, W.-N. Shi, L. Ye, and J.-L. Chen, Phys. Rev. A 102, 012206 (2020)]. Specifically, we derive a tighter lower bound of the tripartite EUR using the Holevo quantity. Furthermore, we generalize the tripartite EUR, that is, the generalized entropic uncertainty relation for multiple measurements in multipartite systems. As illustrations, we provide several typical examples to show that our bound is tight and outperforms the previous bound. Furthermore, our findings pave the way for using the tighter bound for the quantum secret key rate in quantum key distribution protocols and are essential for quantum precision measurements in the framework of genuine multipartite systems. By providing a close peek at the nature of uncertainty, our results may find broad applications in the security analysis of quantum cryptography.

Physical Review A•Dec 28, 2022•47 citations
Entropic uncertainty relations H(A)+H(B)⩾γH(A)+H(B)\geqslant γH(A)+H(B)⩾γ give a nonzero lower bound γγγ to the sum of the Shannon entropies HHH of the outcome probabilities of incompatible observables AAA and BBB. They are better than the variance-based uncertainty relations because they only depend on the Born statistics of the outcomes and not on the outcomes themselves, and because bounds γγγ typically are state independent. Here we provide a state-independent lower bound γsγ_sγs​ that is better than the textbook Maassen-Uffink bound and, in the limit of the parameter s→2s\to 2s→2, becomes asymptotically tight for all A,BA,BA,B. The bound can be extended to Renyi entropies.
After the submission of this paper, we found out that the main results presented here were already on page 6 of https://quantum-journal.org/papers/q-2018-03-30-59/pdf/
The paper considers state-independent lower bounds on the sum of outcome entropies for two projective measurements with overlap matrix Uji=⟨bj∣ai⟩U_{ji}=\langle b_j|a_i\rangleUji​=⟨bj​∣ai​⟩. It expresses these bounds using induced operator norms that depend on the full overlap matrix, rather than only its largest entry.
For 1<s<21<s<21<s<2 and s′=s/(s−1)s'=s/(s-1)s′=s/(s−1), it establishes H(A)+H(B)≥γsH(A)+H(B)\geq\gamma_sH(A)+H(B)≥γs​, where γs=−2s2−slog⁡2∥U∥s→s′\gamma_s=-\frac{2s}{2-s}\log_2\|U\|_{s\to s'}γs​=−2−s2s​log2​∥U∥s→s′​. This is at least the Maassen–Uffink bound −2log⁡2max⁡ij∣Uji∣-2\log_2\max_{ij}|U_{ji}|−2log2​maxij​∣Uji​∣, and γs\gamma_sγs​ converges to the minimum possible Shannon-entropy sum as s→2−s\to2^-s→2−. The same expression is the exact minimum of Hs/2(A)+Hs′/2(B)H_{s/2}(A)+H_{s'/2}(B)Hs/2​(A)+Hs′/2​(B) for each sss. The Shannon bound follows from Riesz–Thorin interpolation and differentiation at the Hilbert-space norm; the Rényi statement follows directly from the induced-norm definition.
Numerical evaluation uses nonlinear power iteration with multiple random initializations. The paper explicitly notes that this procedure can converge to local maxima, so finding the global norm requires repeated starts rather than a supplied certificate. It also gives a qubit reduction to a one-variable minimization, with a closed expression in one angular regime and numerical minimization otherwise. The discussion treats pure states and states that the bounds extend to mixed states.
An addendum in the abstract states that the main results already appeared on page 6 of a 2018 Quantum paper linked there.
The entropic uncertainty principle in the form proven by Maassen and Uffink yields a fundamental inequality that is prominently used in many places all over the field of quantum information theory. In this work, we provide a family of versatile generalizations of this relation. Our proof methods build on a deep connection between entropic uncertainties and interpolation inequalities for the doubly stochastic map that links probability distributions in two measurements bases. In contrast to the original relation, our generalization also incorporates the von Neumann entropy of the underlying quantum state. These results can be directly used to bound the extractable randomness of a source independent QRNG in the presence of fully quantum attacks, to certify entanglement between trusted parties, or to bound the entanglement of a system with an untrusted environment.
The entropic uncertainty principle in the form proven by Maassen and Uffink yields a fundamental inequality that is prominently used in many places all over the field of quantum information theory. In this paper, we provide a family of versatile generalizations of this relation. Our proof methods build on a deep connection between entropic uncertainties and interpolation inequalities for the doubly stochastic map that links probability distributions in two measurement bases. In contrast to the original relation, our generalization also incorporates the von Neumann entropy of the underlying quantum state. These results can be directly used to bound the extractable randomness of a source-independent quantum random number generator in the presence of fully quantum attacks, to certify entanglement between trusted parties, or to bound the entanglement of a system with an untrusted environment. Published by the American Physical Society 2024
The entropic uncertainty principle in the form proven by Maassen and Uffink yields a fundamental inequality that is prominently used in many places all over the field of quantum information theory. In this paper, we provide a family of versatile generalizations of this relation. Our proof methods build on a deep connection between entropic uncertainties and interpolation inequalities for the doubly stochastic map that links probability distributions in two measurement bases. In contrast to the original relation, our generalization also incorporates the von Neumann entropy of the underlying quantum state. These results can be directly used to bound the extractable randomness of a source-independent quantum random number generator in the presence of fully quantum attacks, to certify entanglement between trusted parties, or to bound the entanglement of a system with an untrusted environment.
The entropic way of formulating Heisenberg's uncertainty principle not only plays a fundamental role in applications of quantum information theory but also is essential for manifesting genuine nonclassical features of quantum systems. In this paper we investigate Rényi entropic uncertainty relations (EURs) in the scenario where measurements on individual copies of a quantum system are selected with nonuniform probabilities. In contrast with EURs that characterize an observer's overall lack of information about outcomes with respect to a collection of measurements, we establish state-dependent lower bounds on the weighted sum of entropies over multiple measurements. Conventional EURs thus correspond to the special cases when all weights are equal, and in such cases we show our results are generally stronger than previous ones. Moreover, taking the entropic steering criterion as an example, we numerically verify that our EURs could be advantageous in practical quantum tasks by optimizing the weights assigned to different measurements. Importantly, this optimization does not require quantum resources and is efficiently computable on classical computers. Published by the American Physical Society 2024
The uncertainty principle sets a bound on our ability to predict the measurement outcomes of two incompatible observables which are measured on a quantum particle simultaneously. In quantum information theory, the uncertainty principle can be formulated in terms of the Shannon entropy. Entropic uncertainty bound can be improved by adding a particle which correlates with the measured particle. The added particle acts as a quantum memory. In this work, a method is provided for obtaining the entropic uncertainty relations in the presence of a quantum memory by using quantum coherence. In the method, firstly, one can use the quantum relative entropy of quantum coherence to obtain the uncertainty relations. Secondly, these relations are applied to obtain the entropic uncertainty relations in the presence of a quantum memory. In comparison with other methods this approach is much simpler. Also, for a given state, the upper bounds on the sum of the relative entropies of unilateral coherences are provided, and it is shown which one is tighter. In addition, using the upper bound obtained for unilateral coherence, the nontrivial upper bound on the sum of the entropies for different observables is derived in the presence of a quantum memory.
The uncertainty principle, which demonstrates the intrinsic uncertainty of nature from an information-theory perspective, is at the heart of quantum information theory. In the realm of quantum information theory, Shannon entropy is used to depict the uncertainty relation in general. A tighter lower bound for uncertainty relations facilitates more accurate predictions of measurement outcomes and more robust quantum information processing. Interestingly, the tripartite entropic uncertainty relation (EUR) can be further optimized. Renes et al. proposed a tripartite EUR [J. M. Renes and J.-C. Boileau, Phys. Rev. Lett. 103, 020402 (2009)], and subsequently, Ming et al. strengthened its lower bound in [F. Ming, D. Wang, X.-G. Fan, W.-N. Shi, L. Ye, and J.-L. Chen, Phys. Rev. A 102, 012206 (2020)]. Specifically, we derive a tighter lower bound of the tripartite EUR using the Holevo quantity. Furthermore, we generalize the tripartite EUR, that is, the generalized entropic uncertainty relation for multiple measurements in multipartite systems. As illustrations, we provide several typical examples to show that our bound is tight and outperforms the previous bound. Furthermore, our findings pave the way for using the tighter bound for the quantum secret key rate in quantum key distribution protocols and are essential for quantum precision measurements in the framework of genuine multipartite systems. By providing a close peek at the nature of uncertainty, our results may find broad applications in the security analysis of quantum cryptography.