2014/01/31 by G. Vallone, Giuseppe Vallone, D. Marangon +5
Computer Science · Physics and Astronomy · #Computability, Logic, AI Algorithms #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physreva.90.052327
published as Phys. Rev. A 90, 052327 (2014) · 10 pages
openalex publication_date 2014/11/20 · arxiv created 2014/12/22 · arxiv updated 2014/12/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present an efficient method to extract the amount of true randomness that can be obtained by a quantum random number generator (QRNG). By repeating the measurements of a quantum system and by swapping between two mutually unbiased bases, a lower bound of the achievable true randomness can be evaluated. The bound is obtained thanks to the uncertainty principle of complementary measurements applied to min-entropy and max-entropy. We tested our method with two different QRNGs by using a train of qubits or ququart and demonstrated the scalability toward practical applications.