pith. sign in

arxiv: 1510.08957 · v2 · pith:GGOMT7GHnew · submitted 2015-10-30 · 🪐 quant-ph

Quantum random number generation

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

Quantum physics can be exploited to generate true random numbers, which play important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of quantumness --- coherence, an important feature that differentiates quantum mechanics from classical physics. The generation of genuine randomness is generally considered impossible with only classical means. Based on the degree of trustworthiness on devices, quantum random number generators (QRNGs) can be grouped into three categories. The first category, practical QRNG, is built on fully trusted and calibrated devices and typically can generate randomness at a high speed by properly modeling the devices. The second category is self-testing QRNG, where verifiable randomness can be generated without trusting the actual implementation. The third category, semi-self-testing QRNG, is an intermediate category which provides a tradeoff between the trustworthiness on the device and the random number generation speed.

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.