How random are random numbers generated using photons?

Abstract

Randomness is fundamental in quantum theory, with many philosophical and practical implications. In this paper we discuss the concept of algorithmic randomness, which provides a quantitative method to assess the Borel normality of a given sequence of numbers, a necessary condition for it to be considered random. We use Borel normality as a tool to investigate the randomness of ten sequences of bits generated from the differences between detection times of photon pairs generated by spontaneous parametric downconversion. These sequences are shown to fulfil the randomness criteria without difficulties. As deviations from Borel normality for photon-generated random number sequences have been reported in previous work, a strategy to understand these diverging findings is outlined.

9 pages, 7 figures. To appear in Physica Scripta as an invited Article

References in corpus (7)

• Random Numbers Certified by Bell's Theorem
• Detection-Loophole-Free Test of Quantum Nonlocality, and Applications
• More Randomness from the Same Data
• Practical and fast quantum random number generation based on photon arrival time relative to external reference
• Using complete measurement statistics for optimal device-independent randomness evaluation
• Experimental Evidence of Quantum Randomness Incomputability
• Random Numbers in Scientific Computing: An Introduction

Cited by in corpus (6)

• Experimentally Probing the Algorithmic Randomness and Incomputability of Quantum Randomness
• Kolmogorov complexity of sequences of random numbers generated in Bell's experiments
• Testing randomness of series generated in Bell's experiment
• Improving randomness characterization through Bayesian model selection
• Indistinguishability between quantum randomness and pseudo-randomness under efficiently calculable randomness measures
• Measuring algorithmic complexity in chaotic lasers