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

Abstract

Quantum systems are the ultimate touchstone for the production of random sequences of numbers. Spatially spread entangled systems allow the generation of identical random sequences in remote locations. The impossibility of observing a quantum system, without disturbing it, ensures that the messages encoded using these sequences cannot be eavesdropped. 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. On the other hand, algorithmic randomness is related with the compressibility of the sequence, what is given by Kolmogorov complexity. We analyze sequences generated by entangled pairs of photons focusing on an estimation of their complexity.

arXiv comment5 pages, 2 figures, 1 Table

References in corpus (14)

• Experimental loophole-free violation of a Bell inequality using entangled electron spins separated by 1.3 km
• Violation of Bell's inequality under strict Einstein locality conditions
• Significant-loophole-free test of Bell's theorem with entangled photons
• Random Numbers Certified by Bell's Theorem
• A strong loophole-free test of local realism
• Event-Ready Bell Test Using Entangled Atoms Simultaneously Closing Detection and Locality Loopholes
• Experimentally Generated Randomness Certified by the Impossibility of Superluminal Signals
• Quantum randomness and value indefiniteness
• Experimental Evidence of Quantum Randomness Incomputability
• Randomness extraction from Bell violation with continuous parametric down conversion
• Non-Locality Without Counterfactual Reasoning
• How random are random numbers generated using photons?
• Probing quantum-classical boundary with compression software
• Eberhardt's inequality and recent loophole-free experiments

Cited by in corpus (9)

• Randomness? What randomness?
• Experimentally Probing the Algorithmic Randomness and Incomputability of Quantum Randomness
• Complexity of Shapiro steps
• Testing randomness of series generated in Bell's experiment
• Kolmogorov complexity as intrinsic entropy of a pure state: Perspective from entanglement in free fermion systems
• Indistinguishability between quantum randomness and pseudo-randomness under efficiently calculable randomness measures
• Randomness of imperfectly entangled states
• Using Randomness to decide among Locality, Realism and Ergodicity
• Complexity measures and occurrence of the breaking point in the neutron and gamma-rays time series measured with organic scintillators