Abstract
In contrast with software-generated randomness (called pseudo-randomness), quantum randomness can be proven incomputable; that is, 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.
- Received 9 April 2010
DOI:https://doi.org/10.1103/PhysRevA.82.022102
©2010 American Physical Society