Thursday, April 15, 2010

Random Numbers Certified by Bell’s Theorem

Haven't had time to closely read this yet, but it is a good one.

Abstract: Randomness is a fundamental feature of nature and a valuable resource for applications ranging from cryptography and gambling to numerical simulation of physical and biological systems. Random numbers, however, are difficult to characterize mathematically, and their generation must rely on an unpredictable physical process. Inaccuracies in the theoretical modelling of such processes or failures of the devices, possibly due to adversarial attacks, limit the reliability of random number generators in ways that are difficult to control and detect. Here, inspired by earlier work on non-locality-based and device-independent quantum information processing, we show that the non-local correlations of entangled quantum particles can be used to certify the presence of genuine randomness. It is thereby possible to design a cryptographically secure random number generator that does not require any assumption about the internal working of the device. Such a strong form of randomness generation is impossible classically and possible in quantum systems only if certified by a Bell inequality violation15. We carry out a proof-of-concept demonstration of this proposal in a system of two entangled atoms separated by approximately one metre. The observed Bell inequality violation, featuring near perfect detection efficiency, guarantees that 42 new random numbers are generated with 99 per cent confidence. Our results lay the groundwork for future device-independent quantum information experiments and for addressing fundamental issues raised by the intrinsic randomness of quantum theory.

S. Pironio et al., Nature v.464, p.1021 (2010).

A news report on this paper can be found here.

Zz.

1 comment:

scerir said...

There are two interesting papers by Calude and Svozil et al., one showing it is almost impossible to find differences between a finite pseudo-random string and a finite quantum-random string, the other showing that quantum randomness is uncomputable.
http://arxiv.org/abs/0912.4379
http://arxiv.org/abs/1004.1521