Experimental Evidence of Quantum Randomness Incomputability
classification
🪐 quant-ph
cs.CC
keywords
randomnessquantumevidenceexperimentalincomputabilityalgorithmalgorithmicasymptotic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.