Optimization of experimental quantum randomness expansion
Amelie Piveteau, Alban Seguinard, Piotr Mironowicz, Mohamed Bourennane
TL;DR
This work addresses quantifying and maximizing randomness generated by a device-independent QRNG based on Bell violations. It employs the Entropy Accumulation Theorem with a min-trade-off function, optimizing the smoothing parameter $ε_{ ext{s}}$, test-round probability $γ$, and non-aborting probability $p_ extOmega$, while accounting for switching delays. Through experimental SPDC-based entanglement, and computational benchmarking with the NPA and Brown-Fawzi-Fawzi frameworks, it shows CHSH can reach high asymptotic rates at $7.0 imes10^4$ events/s, and a carefully chosen $ε_{ ext{s}}$ and generation time yield net rates exceeding 50 kbps for long chunks, outperforming previous implementations. The study provides practical guidelines for QRNG design, balancing randomness quality, generation rate, and robustness to finite-size effects and hardware delays, with potential extensions to alternative Bell expressions and faster switching. The results demonstrate a significant step toward high-rate, secure quantum randomness generation suitable for cryptographic applications, under realistic experimental constraints.
Abstract
Quantum technologies provide many applications for information processing tasks that are impossible to realize within classical physics. These capabilities include such fundamental resources as generating secure, i.e. private and unpredictable random values. Yet, the problem of quantifying the amount of generated randomness is still not fully solved. This work presents a comprehensive analysis of the design and performance optimization of a Quantum Random Number Generator (QRNG) based on Bell inequality violations. We investigate key protocol parameters, including the smoothing parameter ($ε_{\text{s}}$), test round probability ($γ$), and switching delays, and their effects on the generation rate and quality of randomness. We identify optimal ranges for $γ$ and $p_Ω$ (the protocol's non-aborting probability) to balance the trade-off between randomness consumption and net randomness generation. Additionally, we explore the impact of switching delays on the system's performance, providing strategies to mitigate these effects. Our results indicate substantial developments in QRNG implementations and offer higher randomness expansion rates. The work provides practical guidelines for the efficient and secure design of QRNG systems and other cryptographic protocols.
