True Quantum Randomness

Wei Wei, Guodong Xie, Anhong Dang +1 more

True randomness is critical to secure communication in both quantum and classical regimes. We propose an approach of true random number generation based on the intrinsic randomness of spontaneous emission. In this approach, a method of random bit extraction was employed to extract true random bits simultaneously as the measurement of the physical entropy source. The random bits generated by the true random number generators have been statistically verified to be bias-free and mutually independent. With the current experimental setup, 7 random bits can be generated in parallel at a rate up to 40 GHz.

Scott Aaronson

Nicolas Gisin

It is argued that realism and true randomness are fully compatible. Realistic true random events are acts of pure creation that obey strict laws, but do not necessarily satisfy Kolmogorov's axioms of probabilities. Realistic true randomness is some sort of nondeterministic force, or propensity of physical systems to manifest such and such properties under such and such conditions. Realistic random events reflect preexisting properties, as required by realism, simply the reflection is not deterministic; still, the preexisting properties determine the propensities of the different possible events. It is argued that deterministic extensions of quantum physics are necessarily incompatible with special relativity. Hence, from today's violations of Bell's inequalities one can conclude that all future physics theories will display true randomness as does quantum physics. It is argued that accepting true randomness and realism leads to new questions with interesting answers, allowing one 1) to study nonlocality in configurations with many independent sources and 2) to bound how much free will is needed for a proper violation of Bell's inequality.

Art Hobson

Riddhi B. Prajapati, Bhavesh B. Prajapati

This chapter provides a concise yet thorough examination of Quantum True Random Number Generators (QTRNGs), focusing on their critical role in generating truly unpredictable and irretrievable random numbers, essential for various security algorithms. The study delves into the foundational principles of QTRNGs, highlighting the physical processes that enable genuine randomness. It also evaluates the security attributes of QTRNGs, discussing potential vulnerabilities and defenses against manipulation and attacks. The chapter concludes by assessing the practical applications and limitations of QTRNGs, offering insights into their current and future relevance in enhancing security in computational systems.