pith. sign in

arxiv: 1311.4547 · v1 · pith:DNN6KCHInew · submitted 2013-11-18 · 🪐 quant-ph · cs.CR

True randomness from realistic quantum devices

classification 🪐 quant-ph cs.CR
keywords randomnesstruequantumapplicationsinformationnecessaryoutputqrngs
0
0 comments X
read the original abstract

Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is usable for applications, e.g., in cryptography or gambling, where unpredictability is important. To enable such applications a stronger notion of randomness, termed "true randomness", is required, which includes independence from prior information. Quantum systems are particularly suitable for true randomness generation, as their unpredictability can be proved based on physical principles. Practical implementations of Quantum RNGs (QRNGs) are however always subject to noise, i.e., influences which are not fully controlled. This reduces the quality of the raw randomness generated by the device, making it necessary to post-process it. Here we provide a framework to analyse realistic QRNGs and to determine the post-processing that is necessary to turn their raw output into true randomness.

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. Simple source device-independent continuous-variable quantum random number generator

    quant-ph 2019-06 unverdicted novelty 6.0

    Source-device-independent CV-QRNG using phase-randomized homodyne detection with gain-switched laser achieves 270 Mbit/s without additional active optical components.