pith. machine review for the scientific record. sign in

arxiv: 0911.3427 · v3 · submitted 2009-11-18 · 🪐 quant-ph

Recognition: unknown

Random Numbers Certified by Bell's Theorem

Authors on Pith no claims yet
classification 🪐 quant-ph
keywords quantumrandomrandomnessbellnumberscertifieddevicesdifficult
0
0 comments X
read the original abstract

Randomness is a fundamental feature in 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 nonlocality based and device independent quantum information processing, we show that the nonlocal correlations of entangled quantum particles can be used to certify the presence of genuine randomness. It is thereby possible to design of a new type of cryptographically secure random number generator which does not require any assumption on the internal working of the devices. This strong form of randomness generation is impossible classically and possible in quantum systems only if certified by a Bell inequality violation. We carry out a proof-of-concept demonstration of this proposal in a system of two entangled atoms separated by approximately 1 meter. The observed Bell inequality violation, featuring near-perfect detection efficiency, guarantees that 42 new random numbers are generated with 99% 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.

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.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The minimal example of quantum network Bell nonlocality

    quant-ph 2026-05 unverdicted novelty 8.0

    Quantum nonlocality is possible in the triangle network with no inputs and binary outputs, which is the smallest such scenario by number of variables and outcomes.