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

The Trivial Bound of Entropic Uncertainty Relations

Minu J. Bae

Published Jul 30, 2022• 0 citations
arXivHTMLPDF

Abstract

Entropic uncertainty relations are underpinning to compute the quantitative security bound in quantum cryptographic applications, such as quantum random number generation (QRNG) and quantum key distribution (QKD). All security proofs derive a relation between the information accessible to the legitimate group and the maximum knowledge that an adversary may have gained, Eve, which exploits entropic uncertainty relations to lower bound Eve's uncertainty about the raw key generated by one party, Alice. The standard entropic uncertainty relations is to utilize the smooth min- and max-entropies to show these cryptographic applications' security by computing the overlap of two incompatible measurements or positive-operator valued measures (POVMs). This paper draws one case of the POVM-versioned standard entropic uncertainty relation yielding the trivial bound since the maximum overlap in POVMs always produces the trivial value, "one." So, it fails to tie the smooth min-entropy to show the security of the quantum cryptographic application.

DOI
10.48550/arxiv.2208.00242

Related papers

Entropic Uncertainty for Biased Measurements

Walter O. Krawec

Entropic Uncertainty relations are powerful tools, especially in quantum cryptography. They typically bound the amount of uncertainty a third-party adversary may hold on a measurement outcome as a result of the measurement overlap. However, when the two measurement bases are biased towards one another, standard entropic uncertainty relations do not always provide optimal lower bounds on the entropy. Here, we derive a new entropic uncertainty relation, for certain quantum states, which can provide a significantly higher bound even if the two measurement bases are no longer mutually unbiased. We evaluate our bound on two different quantum cryptographic protocols, including BB84 with faulty/biased measurement devices, and show that our new bound can produce substantially higher key-rates under several scenarios when compared with prior work using standard entropic uncertainty relations.

arXiv:2305.09753•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•5 citations

A New High-Dimensional Quantum Entropic Uncertainty Relation with Applications

Walter O. Krawec

In this paper we derive a new quantum entropic uncertainty relation, bounding the conditional smooth quantum min entropy based on the result of a measurement using a two outcome POVM and the failure probability of a classical sampling strategy. Our relation works for systems of arbitrary dimension. We apply it to analyze a new source independent quantum random number generation protocol and show our relation provides optimistic results compared to prior work.

arXiv:2005.04773•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•8 citations

Quantum measurement retrodiction and entropic uncertainty relations

Jiaxi Kuang, Kensei Torii, Francesco Buscemi

We study quantum measurement retrodiction using the principle of minimum change. For quantum-to-classical measurement channels, we show that all standard quantum divergences select the same retrodictive update, yielding a unique and divergence-independent quantum Bayesian inverse for any POVM and prior state. Using this update, we construct a symmetric joint distribution for pairs of POVMs and introduce the mutual retrodictability, for which we also derive a general upper bound that depends only on the prior state and holds for all measurements. This structure leads to two retrodictive entropic uncertainty relations, expressed directly in terms of the prior state and the POVMs, but valid independently of the retrodictive framework and fully compatible with the conventional operational interpretation of entropic uncertainty relations. Finally, we benchmark these relations numerically and find that they provide consistently tighter bounds than existing entropic uncertainty relations over broad classes of measurements and states.

quant-pharXiv:2511.20281•Quantum Science and Technology•Nov 26, 2025•0 citations

One-Shot Min-Entropy Calculation of Classical-Quantum States and Its Application to Quantum Cryptography

Rong Wang, H. F. Chau

In quantum Shannon theory, various kinds of quantum entropies are used to characterize the capacities of noisy physical systems. Among them, min-entropy and its smooth version attract wide interest especially in the field of quantum cryptography as they can be used to bound the information obtained by an adversary. However, calculating the exact value or nontrivial bounds of min-entropy are extremely difficult because the composite system dimension may scale exponentially with the dimension of its subsystem. Here, we develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state that is applicable to both finite and infinite dimensional reduced quantum states. Moreover, we show our technique is of practical interest in at least three situations. First, it offers an alternative tight finite-data analysis for the BB84 quantum key distribution scheme. Second, it gives the best finite-key bound known to date for a variant of device independent quantum key distribution protocol. Third, it provides a security proof for a novel source-independent continuous-variable quantum random number generation protocol. These results show the effectiveness and wide applicability of our approach.

arXiv:2406.15226•Physical Review Letters•Jun 9, 2025•3 citations

Rényi formulation of uncertainty relations for POVMs assigned to a quantum design

Alexey E. Rastegin

Abstract Information entropies provide powerful and flexible way to express restrictions imposed by the uncertainty principle. This approach seems to be very suitable in application to problems of quantum information theory. It is typical that questions of such a kind involve measurements having one or another specific structure. The latter often allows us to improve entropic bounds that follow from uncertainty relations of sufficiently general scope. Quantum designs have found use in many issues of quantum information theory, whence uncertainty relations for related measurements are of interest. In this paper, we obtain uncertainty relations in terms of min-entropies and Rényi entropies for POVMs assigned to a quantum design. Relations of the Landau–Pollak type are addressed as well. Using examples of quantum designs in two dimensions, the obtained lower bounds are then compared with the previous ones. An impact on entropic steering inequalities is briefly discussed.

arXiv:2004.05576•Journal of Physics A Mathematical and Theoretical•Jul 23, 2020•12 citations

Review on entropic uncertainty relations

Lijuan Li, Fei Ming, Xue‐Ke Song +2 more

The Heisenberg uncertainty principle is one of the characteristics of quantum mechanics. With the vigorous development of quantum information theory, uncertain relations have gradually played an important role in it. In particular, in order to solved the shortcomings of the concept in the initial formulation of the uncertainty principle, we brought entropy into the uncertainty relation, after that, the entropic uncertainty relation has exploited the advantages to the full in various applications. As we all know the entropic uncertainty relation has became the core element of the security analysis of almost all quantum cryptographic protocols. This review mainly introduces development history and latest progress of uncertain relations. After Heisenberg's argument that incompatible measurement results are impossible to predict, many scholars, inspired by this viewpoint, have made further relevant investigations. They combined the quantum correlation between the observable object and its environment, and carried out various generalizations of the uncertainty relation to obtain more general formulas. In addition, it also focuses on the entropy uncertainty relationship and quantum-memory-assisted entropic uncertainty relation, and the dynamic characteristics of uncertainty in some physical systems. Finally, various applications of the entropy uncertainty relationship in the field of quantum information are discussed, from randomnesss to wave-particle duality to quantum key distribution.

Acta Physica Sinica•Jan 1, 2022•9 citations
Entropic uncertainty relations are underpinning to compute the quantitative security bound in quantum cryptographic applications, such as quantum random number generation (QRNG) and quantum key distribution (QKD). All security proofs derive a relation between the information accessible to the legitimate group and the maximum knowledge that an adversary may have gained, Eve, which exploits entropic uncertainty relations to lower bound Eve's uncertainty about the raw key generated by one party, Alice. The standard entropic uncertainty relations is to utilize the smooth min- and max-entropies to show these cryptographic applications' security by computing the overlap of two incompatible measurements or positive-operator valued measures (POVMs). This paper draws one case of the POVM-versioned standard entropic uncertainty relation yielding the trivial bound since the maximum overlap in POVMs always produces the trivial value, "one." So, it fails to tie the smooth min-entropy to show the security of the quantum cryptographic application.
Entropic Uncertainty relations are powerful tools, especially in quantum cryptography. They typically bound the amount of uncertainty a third-party adversary may hold on a measurement outcome as a result of the measurement overlap. However, when the two measurement bases are biased towards one another, standard entropic uncertainty relations do not always provide optimal lower bounds on the entropy. Here, we derive a new entropic uncertainty relation, for certain quantum states, which can provide a significantly higher bound even if the two measurement bases are no longer mutually unbiased. We evaluate our bound on two different quantum cryptographic protocols, including BB84 with faulty/biased measurement devices, and show that our new bound can produce substantially higher key-rates under several scenarios when compared with prior work using standard entropic uncertainty relations.
We study quantum measurement retrodiction using the principle of minimum change. For quantum-to-classical measurement channels, we show that all standard quantum divergences select the same retrodictive update, yielding a unique and divergence-independent quantum Bayesian inverse for any POVM and prior state. Using this update, we construct a symmetric joint distribution for pairs of POVMs and introduce the mutual retrodictability, for which we also derive a general upper bound that depends only on the prior state and holds for all measurements. This structure leads to two retrodictive entropic uncertainty relations, expressed directly in terms of the prior state and the POVMs, but valid independently of the retrodictive framework and fully compatible with the conventional operational interpretation of entropic uncertainty relations. Finally, we benchmark these relations numerically and find that they provide consistently tighter bounds than existing entropic uncertainty relations over broad classes of measurements and states.
In quantum Shannon theory, various kinds of quantum entropies are used to characterize the capacities of noisy physical systems. Among them, min-entropy and its smooth version attract wide interest especially in the field of quantum cryptography as they can be used to bound the information obtained by an adversary. However, calculating the exact value or nontrivial bounds of min-entropy are extremely difficult because the composite system dimension may scale exponentially with the dimension of its subsystem. Here, we develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state that is applicable to both finite and infinite dimensional reduced quantum states. Moreover, we show our technique is of practical interest in at least three situations. First, it offers an alternative tight finite-data analysis for the BB84 quantum key distribution scheme. Second, it gives the best finite-key bound known to date for a variant of device independent quantum key distribution protocol. Third, it provides a security proof for a novel source-independent continuous-variable quantum random number generation protocol. These results show the effectiveness and wide applicability of our approach.
Abstract Information entropies provide powerful and flexible way to express restrictions imposed by the uncertainty principle. This approach seems to be very suitable in application to problems of quantum information theory. It is typical that questions of such a kind involve measurements having one or another specific structure. The latter often allows us to improve entropic bounds that follow from uncertainty relations of sufficiently general scope. Quantum designs have found use in many issues of quantum information theory, whence uncertainty relations for related measurements are of interest. In this paper, we obtain uncertainty relations in terms of min-entropies and Rényi entropies for POVMs assigned to a quantum design. Relations of the Landau–Pollak type are addressed as well. Using examples of quantum designs in two dimensions, the obtained lower bounds are then compared with the previous ones. An impact on entropic steering inequalities is briefly discussed.
The Heisenberg uncertainty principle is one of the characteristics of quantum mechanics. With the vigorous development of quantum information theory, uncertain relations have gradually played an important role in it. In particular, in order to solved the shortcomings of the concept in the initial formulation of the uncertainty principle, we brought entropy into the uncertainty relation, after that, the entropic uncertainty relation has exploited the advantages to the full in various applications. As we all know the entropic uncertainty relation has became the core element of the security analysis of almost all quantum cryptographic protocols. This review mainly introduces development history and latest progress of uncertain relations. After Heisenberg's argument that incompatible measurement results are impossible to predict, many scholars, inspired by this viewpoint, have made further relevant investigations. They combined the quantum correlation between the observable object and its environment, and carried out various generalizations of the uncertainty relation to obtain more general formulas. In addition, it also focuses on the entropy uncertainty relationship and quantum-memory-assisted entropic uncertainty relation, and the dynamic characteristics of uncertainty in some physical systems. Finally, various applications of the entropy uncertainty relationship in the field of quantum information are discussed, from randomnesss to wave-particle duality to quantum key distribution.