1,188,490 research outputs found
Multiplexed Quantum Random Number Generation
Fast secure random number generation is essential for high-speed encrypted
communication, and is the backbone of information security. Generation of truly
random numbers depends on the intrinsic randomness of the process used and is
usually limited by electronic bandwidth and signal processing data rates. Here
we use a multiplexing scheme to create a fast quantum random number generator
structurally tailored to encryption for distributed computing, and high
bit-rate data transfer. We use vacuum fluctuations measured by seven homodyne
detectors as quantum randomness sources, multiplexed using a single integrated
optical device. We obtain a random number generation rate of 3.08 Gbit/s, from
only 27.5 MHz of sampled detector bandwidth. Furthermore, we take advantage of
the multiplexed nature of our system to demonstrate an unseeded strong
extractor with a generation rate of 26 Mbit/s.Comment: 10 pages, 3 figures and 1 tabl
Source-independent quantum random number generation
Quantum random number generators can provide genuine randomness by appealing
to the fundamental principles of quantum mechanics. In general, a physical
generator contains two parts---a randomness source and its readout. The source
is essential to the quality of the resulting random numbers; hence, it needs to
be carefully calibrated and modeled to achieve information-theoretical provable
randomness. However, in practice, the source is a complicated physical system,
such as a light source or an atomic ensemble, and any deviations in the
real-life implementation from the theoretical model may affect the randomness
of the output. To close this gap, we propose a source-independent scheme for
quantum random number generation in which output randomness can be certified,
even when the source is uncharacterized and untrusted. In our randomness
analysis, we make no assumptions about the dimension of the source. For
instance, multiphoton emissions are allowed in optical implementations. Our
analysis takes into account the finite-key effect with the composable security
definition. In the limit of large data size, the length of the input random
seed is exponentially small compared to that of the output random bit. In
addition, by modifying a quantum key distribution system, we experimentally
demonstrate our scheme and achieve a randomness generation rate of over
bit/s.Comment: 11 pages, 7 figure
- …