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

An entropic uncertainty principle for mixed states

Antonio F. Rotundo, René Schwonnek

Published Mar 20, 2023• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2303.11382

Related papers

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

Conditional entropic uncertainty relations for Tsallis entropies

Dariusz Kurzyk, Łukasz Pawela, Zbigniew Puchała

The entropic uncertainty relations are a very active field of scientific inquiry. Their applications include quantum cryptography and studies of quantum phenomena such as correlations and non-locality. In this work we find entanglement-dependent entropic uncertainty relations in terms of the Tsallis entropies for states with a fixed amount of entanglement. Our main result is stated as Theorem 1 . Taking the special case of von Neumann entropy and utilizing the concavity of conditional von Neumann entropies, we extend our result to mixed states. Finally we provide a lower bound on the amount of extractable key in a quantum cryptographic scenario.

arXiv:1707.09278•Quantum Information Processing•Jun 22, 2018•13 citations

Tighter entropic uncertainty relations in the presence of quantum memories for complete sets of mutually unbiased bases

Qing-Hua Zhang, Cong Xu, Jing-Feng Wu +1 more

Entropic uncertainty relations provide an information-theoretic framework for quantifying the fundamental indeterminacy inherent in quantum mechanics. We propose more stringent quantum-memory-assisted entropic uncertainty relations for complete sets of mutually unbiased bases in multipartite scenarios. We present lower and upper bounds of the quantum uncertainties based on the complementarity of the observables, the purity of the measured state, the (conditional) von-Neumann entropies, the Holevo quantities and mutual information. The results are illustrated by several representative cases, showing that our bounds are tighter than and outperform previously existing bounds.

quant-pharXiv:2604.03990•Advanced Quantum Technologies•Apr 7, 2026•0 citations

Tight Entropic Uncertainty Relations

Alberto Riccardi, Lorenzo Maccone

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/

quant-pharXiv:2605.01832•May 5, 2026•0 citations

Additivity of entropic uncertainty relations

René Schwonnek

We consider the uncertainty between two pairs of local projective measurements performed on a multipartite system. We show that the optimal bound in any linear uncertainty relation, formulated in terms of the Shannon entropy, is additive. This directly implies, against naive intuition, that the minimal entropic uncertainty can always be realized by fully separable states. Hence, in contradiction to proposals by other authors, no entanglement witness can be constructed solely by comparing the attainable uncertainties of entangled and separable states. However, our result gives rise to a huge simplification for computing global uncertainty bounds as they now can be deduced from local ones. Furthermore, we provide the natural generalization of the Maassen and Uffink inequality for linear uncertainty relations with arbitrary positive coefficients.

arXiv:1801.04602•Quantum•Mar 30, 2018•15 citations
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.
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 relations are a very active field of scientific inquiry. Their applications include quantum cryptography and studies of quantum phenomena such as correlations and non-locality. In this work we find entanglement-dependent entropic uncertainty relations in terms of the Tsallis entropies for states with a fixed amount of entanglement. Our main result is stated as Theorem 1 . Taking the special case of von Neumann entropy and utilizing the concavity of conditional von Neumann entropies, we extend our result to mixed states. Finally we provide a lower bound on the amount of extractable key in a quantum cryptographic scenario.
Entropic uncertainty relations provide an information-theoretic framework for quantifying the fundamental indeterminacy inherent in quantum mechanics. We propose more stringent quantum-memory-assisted entropic uncertainty relations for complete sets of mutually unbiased bases in multipartite scenarios. We present lower and upper bounds of the quantum uncertainties based on the complementarity of the observables, the purity of the measured state, the (conditional) von-Neumann entropies, the Holevo quantities and mutual information. The results are illustrated by several representative cases, showing that our bounds are tighter than and outperform previously existing bounds.
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/
We consider the uncertainty between two pairs of local projective measurements performed on a multipartite system. We show that the optimal bound in any linear uncertainty relation, formulated in terms of the Shannon entropy, is additive. This directly implies, against naive intuition, that the minimal entropic uncertainty can always be realized by fully separable states. Hence, in contradiction to proposals by other authors, no entanglement witness can be constructed solely by comparing the attainable uncertainties of entangled and separable states. However, our result gives rise to a huge simplification for computing global uncertainty bounds as they now can be deduced from local ones. Furthermore, we provide the natural generalization of the Maassen and Uffink inequality for linear uncertainty relations with arbitrary positive coefficients.