Experimental Evidence of Quantum Randomness Incomputability

TL;DR

This paper provides experimental evidence that quantum randomness is fundamentally incomputable, distinguishing it from pseudo-randomness generated by algorithms, through tests inspired by algorithmic information theory.

Contribution

It offers the first experimental validation of the incomputability property of quantum randomness using finite tests.

Findings

Quantum randomness is provably incomputable.

Finite tests can distinguish quantum randomness from pseudo-randomness.

Experimental results support the theoretical incomputability of quantum processes.

Abstract

In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an asymptotic property --- of quantum randomness by performing finite tests of randomness inspired by algorithmic information theory.