Randomness is a phenomena which we are confronted with all the time. Will it rain today? Will the train be on time? What present(s) will I receive at Christmas? But are such phenomena truly random?Good randomness is essential for many applications. For instance, cryptography, the art of hiding information from malicious parties, is only as good as the sources of randomness that underlie it. Quantum mechanics, the theory of microscopic phenomena, can only predict the probability of events. For instance quantum theory can only predict the probability that a radioactive nucleus will decay, not when the nucleus will decay. Does this mean that microscopic phenomena are truly random?By studying systems of two entangled particles, it can be shown both theoretically and experimentally that events at the microscopic scale are truly random, truly unpredictable. Beyond its philosophical implications, this result also has important potential applications. Indeed it implies that one can build random number generators whose output is random and certifies that the device works correctly. That is, if the random number generator malfunctions in some way, if the numbers it produces cease to be random, this will automatically be detected. By extending this idea, one could also build quantum cryptographic systems and quantum computers that certify that they work correctly. We discuss the perspectives for practical implementations.
Randomness is a phenomena which we are confronted with all the time. Will it rain today? Will the train be on time? What present(s) will I receive at Christmas? But are such phenomena truly random?Good randomness is essential for many applications. For instance, cryptography, the art of hiding information from malicious parties, is only as good as the sources of randomness that underlie it. Quantum mechanics, the theory of microscopic phenomena, can only predict the probability of events. For instance quantum theory can only predict the probability that a radioactive nucleus will decay, not when the nucleus will decay. Does this mean that microscopic phenomena are truly random?By studying systems of two entangled particles, it can be shown both theoretically and experimentally that events at the microscopic scale are truly random, truly unpredictable. Beyond its philosophical implications, this result also has important potential applications. Indeed it implies that one can build random number generators whose output is random and certifies that the device works correctly. That is, if the random number generator malfunctions in some way, if the numbers it produces cease to be random, this will automatically be detected. By extending this idea, one could also build quantum cryptographic systems and quantum computers that certify that they work correctly. We discuss the perspectives for practical implementations.
Measurements on entangled quantum systems necessarily yield outcomes that are intrinsically unpredictable if they violate a Bell inequality. This property can be used to generate certified randomness in a device-independent way, i.e., without making detailed assumptions about the internal working of the quantum devices used to generate the random numbers. Furthermore these numbers are also private; i.e., they appear random not only to the user but also to any adversary that might possess a perfect description of the devices. Since this process requires a small initial random seed to sample the behavior of the quantum devices and to extract uniform randomness from the raw outputs of the devices, one usually speaks of device-independent randomness expansion. The purpose of this paper is twofold. First, we point out that in most real, practical situations, where the concept of device independence is used as a protection against unintentional flaws or failures of the quantum apparatuses, it is sufficient to show that the generated string is random with respect to an adversary that holds only classical side information; i.e., proving randomness against quantum side information is not necessary. Furthermore, the initial random seed does not need to be private with respect to the adversary, provided that it is generated in a way that is independent from the measured systems. The devices, however, will generate cryptographically secure randomness that cannot be predicted by the adversary, and thus one can, given access to free public randomness, talk about private randomness generation. The theoretical tools to quantify the generated randomness according to these criteria were already introduced in S. Pironio et al. [Nature (London) 464, 1021 (2010)], but the final results were improperly formulated. The second aim of this paper is to correct this inaccurate formulation and therefore lay out a precise theoretical framework for practical device-independent randomness generation.
Randomness is intrinsic to quantum mechanics; the outcome of a measurement on a quantum state is a random variable. This feature has been applied to randomness certification, where one party must decide whether the data they receive is truly random. However, existing demonstrations are not black-box, to avoid falsely certifying deterministic data, assumptions must be made on how the data was generated. Here we demonstrate genuine randomness certification in the black-box setting -- one in which no deterministic adversary, even with unlimited computational power, will succeed in getting their data certified. We use it to provably generate random numbers using only measurements on single particle states and without a random seed.
Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is usable for applications, e.g., in cryptography or gambling, where unpredictability is important. To enable such applications a stronger notion of randomness, termed "true randomness", is required, which includes independence from prior information. Quantum systems are particularly suitable for true randomness generation, as their unpredictability can be proved based on physical principles. Practical implementations of Quantum RNGs (QRNGs) are however always subject to noise, i.e., influences which are not fully controlled. This reduces the quality of the raw randomness generated by the device, making it necessary to post-process it. Here we provide a framework to analyse realistic QRNGs and to determine the post-processing that is necessary to turn their raw output into true randomness.
Random numbers are used to generate cryptographic keys, to run Monte Carlo simulations, and to train and sample machine learning models. Most software obtains them from deterministic pseudo-random number generators, which have good statistical properties but are predictable once their internal state is known. Quantum random number generators take their output from measurements on quantum systems, whose outcomes are not fixed by any prior state of the device. This article introduces the types of random number generators, reviews studies that compare quantum and pseudo-random numbers in numerical experiments, and lists the sources of randomness available in current computing systems. It then describes applications of quantum randomness in security, hashing, software, artificial intelligence, and public randomness. The quality of encryption is treated as depending on three factors: the algorithm, its implementation, and the randomness of keys and other security-relevant values. We give arguments for which applications benefit from quantum randomness, name further areas in which it could be tested, and outline next steps.
Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics.In general, a physical generator contains two parts-a randomness source and its readout.The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness.However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output.To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted.In our randomness analysis, we make no assumptions about the dimension of the source.For instance, multiphoton emissions are allowed in optical implementations.Our analysis takes into account the finite-key effect with the composable security definition.In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit.In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5 × 10 3 bit=s.
One of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations stronger than possible in classical physics. In addition to their theoretical significance, non-local correlations have practical applications, such as device-independent randomness generation, providing private unpredictable numbers even when obtained using devices delivered by an untrusted vendor. Thus, determining the quantity of certifiable randomness that can be produced using a specific set of non-local correlations is of significant interest. First, we present an experimental realization of recent Bell-type operators designed to provide private random numbers that are secure against adversaries with quantum resources. We use semi-definite programming to give lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy in a device-independent scenario. Our results demonstrate the first experiment that certifies nearly two bits of randomness from binary measurements of two parties [1], [2]. Apart from single-round certification, we provide an analysis of finite-key protocol for quantum randomness expansion using the Entropy Accumulation Theorem. Second, we present an efficient and practical method for certifying quantum randomness using generalized measurements. Indeed, we have derived a method for self-testing the presence of POVMs. We present the certification of more than one bit of min-entropy from a single POVM on one of the qubits of an entangled state using a variant of the elegant Bell inequality. We also obtain more than one bit of randomness in a prepare and measure scenario of a similar structure with a POVM on a single qubit [3]. We provide numerical simulations to demonstrate the effectiveness of our randomness certification and expansion.