pith. sign in

arxiv: 1509.07390 · v1 · pith:PS525JF2new · submitted 2015-09-24 · 🪐 quant-ph

Source-device-independent Ultra-fast Quantum Random Number Generation

classification 🪐 quant-ph
keywords randomgenerationmethodnumbersquantumsecureaboveallows
0
0 comments X
read the original abstract

Secure random numbers are a fundamental element of many applications in science, statistics, cryptography and more in general in security protocols. We present a method that enables the generation of high-speed unpredictable random numbers from the quadratures of an electromag- netic field without any assumption on the input state. The method allows to eliminate the numbers that can be predict due the presence of classical and quantum side information. In particular, we introduce a procedure to estimate a bound on the conditional min-entropy based on the Entropic Uncertainty Principle for position and momentum observables of infinite dimensional quantum sys- tems. By the above method, we experimentally demonstrated the generation of secure true random bits at a rate greater than 1 Gbit/s.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum randomness beyond projective measurements

    quant-ph 2026-05 unverdicted novelty 7.0

    Unbiased extremal rank-one measurements generate characterized randomness in dimension 2, with tetrahedral SIC having the least, and SICs achieve maximal 2 log d randomness device-dependently in dimensions where they exist.