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:2005.04773 · IEEE International Symposium on Information Theory (ISIT)

A New High-Dimensional Quantum Entropic Uncertainty Relation with Applications

Walter O. Krawec

Published Jun 1, 2020• 8 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/isit44484.2020.9174330

Related papers

Quantum Sampling for Finite Key Rates in High Dimensional Quantum Cryptography

Keegan Yao, Walter O. Krawec, Jiadong Zhu

It has been shown recently that the framework of quantum sampling, as introduced by Bouman and Fehr, can lead to new entropic uncertainty relations highly applicable to finite-key cryptographic analyses. Here we revisit these so-called sampling-based entropic uncertainty relations, deriving newer, more powerful, relations and applying them to source-independent quantum random number generators and high-dimensional quantum key distribution protocols. Along the way, we prove several interesting results in the asymptotic case for our entropic uncertainty relations. These sampling-based approaches to entropic uncertainty, and their application to quantum cryptography, hold great potential for deriving proofs of security for quantum cryptographic systems, and the approaches we use here may be applicable to an even wider range of scenarios.

arXiv:2012.04151•IEEE Transactions on Information Theory•Jan 11, 2022•22 citations

The Trivial Bound of Entropic Uncertainty Relations

Minu J. Bae

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.

arXiv:2208.00242•Jul 30, 2022•0 citations

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

Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling

Frédéric Dupuis, Omar Fawzi, Stephanie Wehner

A natural measure for the amount of quantum information that a physical system E holds about another system A = A 1 ,..., A n is given by the min-entropy H min ( A | E ). Specifically, the min-entropy measures the amount of entanglement between E and A , and is the relevant measure when analyzing a wide variety of problems ranging from randomness extraction in quantum cryptography, decoupling used in channel coding, to physical processes such as thermalization or the thermodynamic work cost (or gain) of erasing a quantum system. As such, it is a central question to determine the behaviour of the min-entropy after some process M is applied to the system A . Here we introduce a new generic tool relating the resulting min-entropy to the original one, and apply it to several settings of interest, including sampling of subsystems and measuring in a randomly chosen basis. The results on random measurements yield new high-order entropic uncertainty relations with which we prove the optimality of cryptographic schemes in the bounded quantum storage model. This is an abridged version of the paper; the full version containing all proofs and further applications can be found in [13]. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Lecture notes in computer science•Jan 1, 2013•4 citations

A Tight High-Order Entropic Quantum Uncertainty Relation With Applications

Ivan Damgaard, Serge Fehr, Renato Renner +2 more

We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quantum 1-out-of-2 Oblivious Transfer and quantum Bit Commitment are presented and the uncertainty relation is used to prove the security of these protocols in the bounded quantum-storage model according to new strong security definitions. As another application, we consider the realistic setting of Quantum Key Distribution (QKD) against quantum-memory-bounded eavesdroppers. The uncertainty relation allows to prove the security of QKD protocols in this setting while tolerating considerably higher error rates compared to the standard model with unbounded adversaries. For instance, for the six-state protocol with one-way communication, a bit-flip error rate of up to 17% can be tolerated (compared to 13% in the standard model). Our uncertainty relation also yields a lower bound on the min-entropy key uncertainty against known-plaintext attacks when quantum ciphers are composed. Previously, the key uncertainty of these ciphers was only known with respect to Shannon entropy.

arXiv:quant-ph/0612014•Dec 2, 2006•14 citations

Min-entropy uncertainty relation for finite-size cryptography

Nelly H. Y. Ng, Mario Berta, Stephanie Wehner

Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are therefore relations in terms of the smooth min-entropy for Bennett-Brassard 1984 (BB84) and six-state encodings. The smooth min-entropy ${H}_{\mathrm{min}}^{\ensuremath{\epsilon}}(X/B)$ quantifies the negative logarithm of the probability for an attacker $B$ to guess $X$, except with a small failure probability $\ensuremath{\epsilon}$. Previously, strong uncertainty relations were obtained which are valid in the limit of large block lengths. Here, we prove an alternative uncertainty relation in terms of the smooth min-entropy that is only marginally less strong but has the crucial property that it can be applied to rather small block lengths. This paves the way for a practical implementation of many cryptographic protocols. As part of our proof we show tight uncertainty relations for a family of R\'enyi entropies that may be of independent interest.

arXiv:1205.0842•Physical Review A•Oct 15, 2012•58 citations
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.
It has been shown recently that the framework of quantum sampling, as introduced by Bouman and Fehr, can lead to new entropic uncertainty relations highly applicable to finite-key cryptographic analyses. Here we revisit these so-called sampling-based entropic uncertainty relations, deriving newer, more powerful, relations and applying them to source-independent quantum random number generators and high-dimensional quantum key distribution protocols. Along the way, we prove several interesting results in the asymptotic case for our entropic uncertainty relations. These sampling-based approaches to entropic uncertainty, and their application to quantum cryptography, hold great potential for deriving proofs of security for quantum cryptographic systems, and the approaches we use here may be applicable to an even wider range of scenarios.
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.
A natural measure for the amount of quantum information that a physical system E holds about another system A = A 1 ,..., A n is given by the min-entropy H min ( A | E ). Specifically, the min-entropy measures the amount of entanglement between E and A , and is the relevant measure when analyzing a wide variety of problems ranging from randomness extraction in quantum cryptography, decoupling used in channel coding, to physical processes such as thermalization or the thermodynamic work cost (or gain) of erasing a quantum system. As such, it is a central question to determine the behaviour of the min-entropy after some process M is applied to the system A . Here we introduce a new generic tool relating the resulting min-entropy to the original one, and apply it to several settings of interest, including sampling of subsystems and measuring in a randomly chosen basis. The results on random measurements yield new high-order entropic uncertainty relations with which we prove the optimality of cryptographic schemes in the bounded quantum storage model. This is an abridged version of the paper; the full version containing all proofs and further applications can be found in [13]. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quantum 1-out-of-2 Oblivious Transfer and quantum Bit Commitment are presented and the uncertainty relation is used to prove the security of these protocols in the bounded quantum-storage model according to new strong security definitions. As another application, we consider the realistic setting of Quantum Key Distribution (QKD) against quantum-memory-bounded eavesdroppers. The uncertainty relation allows to prove the security of QKD protocols in this setting while tolerating considerably higher error rates compared to the standard model with unbounded adversaries. For instance, for the six-state protocol with one-way communication, a bit-flip error rate of up to 17% can be tolerated (compared to 13% in the standard model). Our uncertainty relation also yields a lower bound on the min-entropy key uncertainty against known-plaintext attacks when quantum ciphers are composed. Previously, the key uncertainty of these ciphers was only known with respect to Shannon entropy.
Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are therefore relations in terms of the smooth min-entropy for Bennett-Brassard 1984 (BB84) and six-state encodings. The smooth min-entropy ${H}_{\mathrm{min}}^{\ensuremath{\epsilon}}(X/B)$ quantifies the negative logarithm of the probability for an attacker BBB to guess XXX, except with a small failure probability $\ensuremath{\epsilon}$. Previously, strong uncertainty relations were obtained which are valid in the limit of large block lengths. Here, we prove an alternative uncertainty relation in terms of the smooth min-entropy that is only marginally less strong but has the crucial property that it can be applied to rather small block lengths. This paves the way for a practical implementation of many cryptographic protocols. As part of our proof we show tight uncertainty relations for a family of R\'enyi entropies that may be of independent interest.