Experimental Evidence of Quantum Randomness Incomputability
Quantum Physics
2010-08-09 v2 Computational Complexity
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.
Cite
@article{arxiv.1004.1521,
title = {Experimental Evidence of Quantum Randomness Incomputability},
author = {Cristian S. Calude and Michael J. Dinneen and Monica Dumitrescu and Karl Svozil},
journal= {arXiv preprint arXiv:1004.1521},
year = {2010}
}
Comments
23 pages, 5 figures, statistical analysis added, other sections greatly expanded