arXiv Analytics

Sign in

arXiv:1207.1473 [quant-ph]AbstractReferencesReviewsResources

Postprocessing for quantum random number generators: entropy evaluation and randomness extraction

Xiongfeng Ma, Feihu Xu, He Xu, Xiaoqing Tan, Bing Qi, Hoi-Kwong Lo

Published 2012-07-05, updated 2013-06-22Version 2

Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to classical noises. To distill this quantum randomness, one needs to quantify the randomness of the source and apply a randomness extractor. Here, we propose a generic framework for evaluating quantum randomness of real-life QRNGs by min-entropy, and apply it to two different existing quantum random-number systems in the literature. Moreover, we provide a guideline of QRNG data postprocessing for which we implement two information-theoretically provable randomness extractors: Toeplitz-hashing extractor and Trevisan's extractor.

Related articles: Most relevant | Search more
arXiv:1806.08762 [quant-ph] (Published 2018-06-22)
Experimentally Probing the Incomputability of Quantum Randomness
arXiv:2206.05328 [quant-ph] (Published 2022-06-10)
Quantum Random Number Generators : Benchmarking and Challenges
arXiv:1103.4381 [quant-ph] (Published 2011-03-22)
Quantum random number generators and their use in cryptography