Kolmogorov complexity of sequences of random numbers generated in Bell's experiments

Abstract

Quantum states are the ultimate criterion to produce sequences of random numbers. Spatially spread entangled states allow the generation of correlated random sequences in remote locations. The impossibility of observing a quantum state, without disturbing it, ensures that the messages encoded using these sequences cannot be eavesdropped upon. This is the basis of quantum key distribution. It is then of crucial importance knowing whether the sequences generated in the practice by spatially spread entangled states are truly random, or not. Yet, that knowledge is not immediate. One of the obstacles is the very definition of randomness. "Statistical" randomness is related with the frequency of occurrence of strings of data. "Algorithmic" randomness is related with compressibility of the sequence, which is given by Kolmogorov complexity. Sequences generated by entangled pairs of photons are analyzed, focusing on estimations of their complexity. Standard tests of statistical randomness are also applied.