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:2305.09753 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Entropic Uncertainty for Biased Measurements

Walter O. Krawec

Published Sep 17, 2023• 5 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/qce57702.2023.00138

Related papers

Optimized entropic uncertainty relations for multiple measurements

Bo-Fu Xie, Fei Ming, Dong Wang +2 more

Recently, an entropic uncertainty relation for multiple measurements was proposed by Liu et al. [Phys. Rev. A 91, 042133 (2015)]. However, the lower bound of the relation is not always tight with respect to different measurements. Herein, we improve the lower bound of the entropic uncertainty relation for multiple measurements, referred to as a simply constructed bound (SCB). We verify that the SCB is tighter than Liu et al.'s result for arbitrary mutually unbiased basis measurements, which might play a fundamental and crucial role in practical quantum information processing. Moreover, we optimize the SCB by considering mutual information and the Holevo quantity, and propose an optimized SCB. Notably, the proposed bounds are extrapolations of the behavior of two measurements to a larger collection of measurements. It is believed that our findings would shed light on entropy-based uncertainty relations in the multiple measurement scenario and will be beneficial for security analysis in quantum key distributions.

arXiv:2112.00917•Physical Review A•Dec 10, 2021•74 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

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

Entropic uncertainty relations and locking: Tight bounds for mutually unbiased bases

Manuel A. Ballester, Stephanie Wehner

We prove tight entropic uncertainty relations for a large number of mutually unbiased measurements. In particular, we show that a bound derived from the result by Maassen and Uffink [Phys. Rev. Lett. 60, 1103 (1988)] for two such measurements can in fact be tight for up to $\sqrt{d}$ measurements in mutually unbiased bases. We then show that using more mutually unbiased bases does not always lead to a better locking effect. We prove that the optimal bound for the accessible information using up to $\sqrt{d}$ specific mutually unbiased bases is $\mathrm{log}\phantom{\rule{0.2em}{0ex}}d∕2$, which is the same as can be achieved by using only two bases. Our result indicates that merely using mutually unbiased bases is not sufficient to achieve a strong locking effect and we need to look for additional properties.

arXiv:quant-ph/0606244•Physical Review A•Feb 21, 2007•110 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

Limits on entropic uncertainty relations

Andris Ambainis

We consider entropic uncertainty relations for outcomes of the measurements of a quantum state in 3 or more mutually unbiased bases (MUBs), chosen from the standard construction of MUBs in prime dimension. We show that, for any choice of 3 MUBs and at least one choice of a larger number of MUBs, the best possible entropic uncertainty relation can be only marginally better than the one that trivially follows from the relation by Maassen and Uffink for 2 bases.

arXiv:0909.3720•Quantum Information and Computation•Sep 1, 2010•11 citations
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.
Recently, an entropic uncertainty relation for multiple measurements was proposed by Liu et al. [Phys. Rev. A 91, 042133 (2015)]. However, the lower bound of the relation is not always tight with respect to different measurements. Herein, we improve the lower bound of the entropic uncertainty relation for multiple measurements, referred to as a simply constructed bound (SCB). We verify that the SCB is tighter than Liu et al.'s result for arbitrary mutually unbiased basis measurements, which might play a fundamental and crucial role in practical quantum information processing. Moreover, we optimize the SCB by considering mutual information and the Holevo quantity, and propose an optimized SCB. Notably, the proposed bounds are extrapolations of the behavior of two measurements to a larger collection of measurements. It is believed that our findings would shed light on entropy-based uncertainty relations in the multiple measurement scenario and will be beneficial for security analysis in quantum key distributions.
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 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.
We prove tight entropic uncertainty relations for a large number of mutually unbiased measurements. In particular, we show that a bound derived from the result by Maassen and Uffink [Phys. Rev. Lett. 60, 1103 (1988)] for two such measurements can in fact be tight for up to d\sqrt{d}d​ measurements in mutually unbiased bases. We then show that using more mutually unbiased bases does not always lead to a better locking effect. We prove that the optimal bound for the accessible information using up to d\sqrt{d}d​ specific mutually unbiased bases is logd∕2\mathrm{log}\phantom{\rule{0.2em}{0ex}}d∕2logd∕2, which is the same as can be achieved by using only two bases. Our result indicates that merely using mutually unbiased bases is not sufficient to achieve a strong locking effect and we need to look for additional properties.
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.