2016/12/31 by Jonatan Bohr Brask, Anthony Martin, William Esposito +4
Computer Science · Physics and Astronomy · #Generator (circuit theory) #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Random number generation #Simple (philosophy) #State (computer science) #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physrevapplied.7.054018
published as Phys. Rev. Applied 7, 054018 (2017) · 9 pages, 6 figures
openalex created_date 2017/01/06 · openalex publication_date 2017/05/25 · arxiv created 2017/05/31 · arxiv updated 2017/06/01 · openalex updated_date 2026/08/06
Generating certifiably random bit sequences using quantum devices is a fundamental challenge for cryptography, particularly as applied to secure communication. The device-independent approach offers the best security, but is impractical. This study presents a quantum random-number generator (QRNG) that is simple and achieves high bit rates, yet requires only mild assumptions (almost no trust) regarding the setup. This protocol offers a promising solution for the next generation of QRNGs, combining ease of implementation, commercially viable rates, and strong security.