Applications of randomness such as private key generation and public randomness beacons require small blocks of certified random bits on demand. Device-independent quantum random number generators can produce such random bits, but existing quantum-proof protocols and loophole-free implementations suffer from high latency, requiring many hours to produce any random bits. We demonstrate device-independent quantum randomness generation from a loophole-free Bell test with a more efficient quantum-proof protocol, obtaining multiple blocks of 512 bits with an average experiment time of less than 5 min per block and with certified error bounded by 2\−64\≈5.42\×10\−20.

}, url = {https://arxiv.org/abs/1812.07786}, author = {Yanbao Zhang and Lynden K. Shalm and Joshua C. Bienfang and Martin J. Stevens and Michael D. Mazurek and Sae Woo Nam and Carlos Abell{\'a}n and Waldimar Amaya and Morgan W. Mitchell and Honghao Fu and Carl A. Miller and Alan Mink and Emanuel Knill} } @article {2282, title = {Experimentally Generated Randomness Certified by the Impossibility of Superluminal Signals}, journal = {Nature}, volume = {556}, year = {2018}, month = {2018/04/11}, pages = {223-226}, abstract = {From dice to modern complex circuits, there have been many attempts to build increasingly better devices to generate random numbers. Today, randomness is fundamental to security and cryptographic systems, as well as safeguarding privacy. A key challenge with random number generators is that it is hard to ensure that their outputs are unpredictable. For a random number generator based on a physical process, such as a noisy classical system or an elementary quantum measurement, a detailed model describing the underlying physics is required to assert unpredictability. Such a model must make a number of assumptions that may not be valid, thereby compromising the integrity of the device. However, it is possible to exploit the phenomenon of quantum nonlocality with a loophole-free Bell test to build a random number generator that can produce output that is unpredictable to any adversary limited only by general physical principles. With recent technological developments, it is now possible to carry out such a loophole-free Bell test. Here we present certified randomness obtained from a photonic Bell experiment and extract 1024 random bits uniform to within 10\−12. These random bits could not have been predicted within any physical theory that prohibits superluminal signaling and allows one to make independent measurement choices. To certify and quantify the randomness, we describe a new protocol that is optimized for apparatuses characterized by a low per-trial violation of Bell inequalities. We thus enlisted an experimental result that fundamentally challenges the notion of determinism to build a system that can increase trust in random sources. In the future, random number generators based on loophole-free Bell tests may play a role in increasing the security and trust of our cryptographic systems and infrastructure.

}, doi = {https://doi.org/10.1038/s41586-018-0019-0}, url = {https://arxiv.org/abs/1803.06219}, author = {Peter Bierhorst and Emanuel Knill and Scott Glancy and Yanbao Zhang and Alan Mink and Stephen Jordan and Andrea Rommal and Yi-Kai Liu and Bradley Christensen and Sae Woo Nam and Martin J. Stevens and Lynden K. Shalm} } @article {2324, title = {Quantum Probability Estimation for Randomness with Quantum Side Information}, year = {2018}, abstract = {We develop a quantum version of the probability estimation framework [arXiv:1709.06159] for randomness generation with quantum side information. We show that most of the properties of probability estimation hold for quantum probability estimation (QPE). This includes asymptotic optimality at constant error and randomness expansion with logarithmic input entropy. QPE is implemented by constructing model-dependent quantum estimation factors (QEFs), which yield statistical confidence upper bounds on data-conditional normalized R{\'e}nyi powers. This leads to conditional min-entropy estimates for randomness generation. The bounds are valid for relevant models of sequences of experimental trials without requiring independent and identical or stationary behavior. QEFs may be adapted to changing conditions during the sequence and trials can be stopped any time, such as when the results so far are satisfactory. QEFs can be constructed from entropy estimators to improve the bounds for conditional min-entropy of classical-quantum states from the entropy accumulation framework [Dupuis, Fawzi and Renner, arXiv:1607.01796]. QEFs are applicable to a larger class of models, including models permitting measurement devices with super-quantum but non-signaling behaviors and semi-device dependent models. The improved bounds are relevant for finite data or error bounds of the form e\−κs, where s is the number of random bits produced. We give a general construction of entropy estimators based on maximum probability estimators, which exist for many configurations. For the class of (k,2,2) Bell-test configurations we provide schemas for directly optimizing QEFs to overcome the limitations of entropy-estimator-based constructions. We obtain and apply QEFs for examples involving the (2,2,2) Bell-test configuration to demonstrate substantial improvements in finite-data efficiency.\

}, url = {https://arxiv.org/abs/1806.04553}, author = {Emanuel Knill and Yanbao Zhang and Honghao Fu} } @article {1945, title = {Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling}, year = {2017}, month = {2017/02/16}, abstract = {Random numbers are an important resource for applications such as numerical simulation and secure communication. However, it is difficult to certify whether a physical random number generator is truly unpredictable. Here, we exploit the phenomenon of quantum nonlocality in a loophole-free photonic Bell test experiment for the generation of randomness that cannot be predicted within any physical theory that allows one to make independent measurement choices and prohibits superluminal signaling. To certify and quantify the randomness, we describe a new protocol that performs well in an experimental regime characterized by low violation of Bell inequalities. Applying an extractor function to our data, we obtained 256 new random bits, uniform to within 0.001.

}, url = {https://arxiv.org/abs/1702.05178$\#$}, author = {Peter Bierhorst and Emanuel Knill and Scott Glancy and Alan Mink and Stephen P. Jordan and Andrea Rommal and Yi-Kai Liu and Bradley Christensen and Sae Woo Nam and Lynden K. Shalm} }