pith. sign in

arxiv: 1207.1473 · v2 · pith:BX7UPC7Cnew · submitted 2012-07-05 · 🪐 quant-ph · cs.CR

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

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

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.

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. Stream randomness extraction against quantum side information

    quant-ph 2026-05 unverdicted novelty 7.0

    Stream implementations of universal2 randomness extractors preserve security against quantum side information by precomputing a pseudo-random mask and applying bitwise XOR to raw data in real time.