Optimization of experimental quantum randomness expansion

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 ($\epsilon_{\text{s}}$), test round probability ($\gamma$), and switching delays, and their effects on the generation rate and quality of randomness. We identify optimal ranges for $\gamma$ and $p_\Omega$ (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.