How Random Is Quantum Randomness? An Experimental Approach
arXiv:0912.4379
Abstract
Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness--recently proved to be theoretically incomputable--and some well-known computable sources of pseudo-randomness. Incomputability is a necessary, but not sufficient "symptom" of "true randomness". We base our experimental approach on algorithmic information theory which provides characterizations of algorithmic random sequences in terms of the degrees of incompressibility of their finite prefixes. Algorithmic random sequences are incomputable, but the converse implication is false. We have performed tests of randomness on pseudo-random strings (finite sequences) of length generated with software (Mathematica, Maple), which are cyclic (so, strongly computable), the bits of , which is computable, but not cyclic, and strings produced by quantum measurements (with the commercial device Quantis and by the Vienna IQOQI group). Our empirical tests indicate quantitative differences, some statistically significant, between computable and incomputable sources of "randomness".
49 pages, 5 figures
References in corpus (11)
- Hidden Variables and the Two Theorems of John Bell
- Experimentally testable state-independent quantum contextuality
- A High Speed, Post-Processing Free, Quantum Random Number Generator
- Secure self-calibrating quantum random bit generator
- Quantum randomness and value indefiniteness
- Three criteria for quantum random number generators based on beam splitters
- Non-deterministic random bit generator based on electronics noise
- Staging quantum cryptography with chocolate balls
- Entropy of Pseudo Random Number Generators
- Proposed direct test of a certain type of noncontextuality in quantum mechanics
- Are simultaneous Bell measurements possible?