Long term test of a fast and compact Quantum Random Number Generator
Davide G. Marangon, Alan Plews, Marco Lucamarini, James F. Dynes,, Andrew W. Sharpe, Zhiliang Yuan, Andrew J. Shields

TL;DR
This paper presents a compact, reliable quantum random number generator capable of generating 8 Gbit/s continuously for 71 days, with real-time monitoring and passing rigorous statistical tests, demonstrating its practical viability.
Contribution
The authors developed a fast, stable, and self-contained QRNG that operates continuously for over two months, addressing previous limitations of speed, reliability, and practicality.
Findings
Operates at 8 Gbit/s continuously for 71 days
Maintains physical stability and hardware reliability
Passes all stringent statistical randomness tests
Abstract
Random numbers are an essential resource to many applications, including cryptography and Monte Carlo simulations. Quantum random number generators (QRNGs) represent the ultimate source of randomness, as the numbers are obtained by sampling a physical quantum process that is intrinsically probabilistic. However, they are yet to be widely employed to replace deterministic pseudo random number generators (PRNG) for practical applications. QRNGs are regarded as interesting devices. However they are slower than PRNGs for simulations and are typically seen as clumsy laboratory prototypes, prone to failures and unreliable for cryptographic applications. Here we overcome these limitations and demonstrate a compact and self-contained QRNG capable of generating random numbers at a pace of 8 Gbit/s uninterruptedly for 71 days. During this period, the physical parameters of the quantum process…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
