• Corpus ID: 256080471

The Trivial Bound of Entropic Uncertainty Relations

@inproceedings{Bae2022TheTB,
  title={The Trivial Bound of Entropic Uncertainty Relations},
  author={Min Ju Bae},
  year={2022}
}
  • M. Bae
  • Published 30 July 2022
  • Computer Science
Entropic uncertainty relations are underpinning to compute the quan-titative 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… 

Figures from this paper

References

SHOWING 1-10 OF 46 REFERENCES

Entropic uncertainty relations and their applications

This review surveys entropic uncertainty relations that capture Heisenberg’s idea that the results of incompatible measurements are impossible to predict, covering both finite- and infinite-dimensional measurements.

A framework for non-asymptotic quantum information theory

This thesis consolidates, improves and extends the smooth entropy framework for non-asymptotic information theory and cryptography, and introduces the purified distance, a novel metric for unnormalized quantum states, and explores various properties of these entropies, including data-processing inequalities, chain rules and their classical limits.

Semi-Source Independent Quantum Walk Random Number Generation

This paper analyzes a SI-QRNG protocol based on quantum walks and derives a novel entropic uncertainty relation for this application which is necessary since standard relations actually fail in this case.

Quantum sampling and entropic uncertainty

The quantum sampling technique is used to derive a novel entropic uncertainty relation based on smooth min- entropy, the binary Shannon entropy of an observed outcome, and the probability of failure of a classical sampling strategy.

Security of quantum key distribution

  • R. Renner
  • Computer Science
    Ausgezeichnete Informatikdissertationen
  • 2005
This work proposes an approach which allows us to study general physical systems for which the above mentioned independence condition does not necessarily hold, and introduces new uncertainty measures, called smooth min- and max-entropy, which are generalizations of information-theoretical notions.

Relative entropy derivation of the uncertainty principle with quantum side information

We give a simple proof of the uncertainty principle with quantum side information, as in [Berta et al. Nature Physics 6, 659 (2010)], invoking the monotonicity of the relative entropy. Our proof

Leftover Hashing against quantum side information

A (strictly) more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system is proved and applies to arbitrary δ-almost two-universal families of hash functions.

One-Shot Classical Data Compression With Quantum Side Information and the Distillation of Common Randomness or Secret Keys

In this hybrid classical-quantum version of the famous Slepian-Wolf problem, the smooth max entropy is found to govern the number of bits into which classical information can be compressed so that it can be reliably recovered from the compressed version and quantum side information.

True randomness from realistic quantum devices

Here this work provides a framework to analyse realistic QRNGs and to determine the post-processing that is necessary to turn their raw output into true randomness.

Quantum randomness certified by the uncertainty principle

We present an efficient method to extract the amount of true randomness that can be obtained by a Quantum Random Number Generator (QRNG). By repeating the measurements of a quantum system and by