Related papers: High speed self-testing quantum random number gene…
Random numbers are indispensable for a variety of applications ranging from testing physics foundation to information encryption. In particular, nonlocality tests provide a strong evidence to our current understanding of nature -- quantum…
In recent decades, quantum technologies have made significant strides toward achieving quantum utility. However, practical applications are hindered by challenges related to scaling the number of qubits and the depth of circuits. In this…
Quantum Random Number Generators provide true physical randomness based on quantum processes, essential for cryptographic and scientific applications. However, practical implementations face challenges in robustness and verifiability:…
Random numbers are commonly used in many different fields, ranging from simulations in fundamental science to security applications. In some critical cases, as Bell's tests and cryptography, the random numbers are required to be both secure…
The fundamental principles of quantum mechanics, such as its probabilistic nature, allow for the theoretical ability of quantum computers to generate statistically random numbers, as opposed to classical computers which are only able to…
Quantum random number generators (QRNGs) promise perfectly unpredictable random numbers. However, the security certification of the random numbers in form of a stochastic model often introduces assumptions that are either hardly justified…
A remarkable aspect of quantum theory is that certain measurement outcomes are entirely unpredictable to all possible observers. Such quantum events can be harnessed to generate numbers whose randomness is asserted based upon the underlying…
The rates at which a user can generate device-independent quantum random numbers from a Bell-type experiment depend on the measurements that he performs. By numerically optimising over these measurements, we present lower bounds on the…
We demonstrate a quantum random number generator based on the random nature of the phase difference between two independent laser sources. The speed of random bit generation is determined by the photodetector bandwidth and the linewidth of…
Randomness, mainly in the form of random numbers, is the fundamental prerequisite for the security of many cryptographic tasks. Quantum randomness can be extracted even if adversaries are fully aware of the protocol and even control the…
Randomness is a very important resource for cryptography, algorithms, and scientific simulations. Since all classical processes are considered to be intrinsically deterministic, we must build quantum random number generators which utilize…
The ultimate random number generators are those certified to be unpredictable -- including to an adversary. The use of simple quantum processes promises to provide numbers that no physical observer could predict but, in practice, unwanted…
The generation of random numbers via quantum processes is an efficient and reliable method to obtain true indeterministic random numbers that are of vital importance to cryptographic communication and large-scale computer modeling. However,…
The power of quantum random number generation is more than just the ability to create truly random numbers$\unicode{x2013}$it can also enable self-testing, which allows the user to verify the implementation integrity of certain critical…
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.,…
Random numbers form an intrinsic part of modern day computing with applications in a wide variety of fields. But due to their limitations, the use of pseudo random number generators (PRNGs) is certainly not desirable for sensitive…
Device-independent randomness generation and quantum key distribution protocols rely on a fundamental relation between the non-locality of quantum theory and its random character. This relation is usually expressed in terms of a trade-off…
Random numbers represent an indispensable resource for many applications. A recent remarkable result is the realization that non-locality in quantum mechanics can be used to certify genuine randomness through Bell's theorem, producing…
Pseudo-random number generators are widely used in many branches of science, mainly in applications related to Monte Carlo methods, although they are deterministic in design and, therefore, unsuitable for tackling fundamental problems in…
Self-testing is a method to certify devices from the result of a Bell test. Although examples of noise tolerant self-testing are known, it is not clear how to deal efficiently with a finite number of experimental trials to certify the…