Related papers: Quantum random number generation
Quantum entanglement represents an ideal resource to guarantee the security of random numbers employed in many scientific and cryptographic applications. However, entanglement-based certified random number generators are particularly…
Nowadays random number generation plays an essential role in technology with important applications in areas ranging from cryptography, which lies at the core of current communication protocols, to Monte Carlo methods, and other…
Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to…
Quantum random number generators (QRNGs) based on quadrature measurements of the vacuum have so far used balanced homodyne detection to obtain a source of high entropy. Here we propose a simple direct detection measurement scheme using only…
The generation of certifiable randomness is one of the most promising applications of quantum technologies. Furthermore, the intrinsic non-locality of quantum correlations allow us to certify randomness in a device-independent way, i.e. one…
Complex numbers play a crucial role in quantum mechanics. However, their necessity remains debated: whether they are fundamental or merely convenient. Recently, it was claimed that quantum mechanics based on real numbers can be…
Randomness is a crucial resource for a broad range of important applications, such as Monte Carlo simulation and computation, generative artificial intelligence and cryptography. But what is randomness? A widely accepted definition has…
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.,…
It is often said that quantum and classical randomness are of different nature, the former being ontological and the latter epistemological. However, so far the question of "What is quantum in quantum randomness", i.e. what is the impact of…
Conventional random number generators provide the speed but not necessarily the high quality output streams needed for large-scale stochastic simulations. Cryptographically-based generators, on the other hand, provide superior quality…
Quantum mechanics is derived from the principle that the universe contain as much variety as possible, in the sense of maximizing the distinctiveness of each subsystem. The quantum state of a microscopic system is defined to correspond to…
The unpredictable process of state collapse caused by quantum measurements makes the generation of quantum randomness possible. In this paper, we explore the quantitive connection between the randomness generation and the state collapse and…
We produce two strings of quantum random numbers simultaneously from the intensity fluctuations of the twin beams generated by a nondegenerate optical parametric oscillator. Two strings of quantum random numbers with bit rates up to 60 Mb/s…
We present a high-quality, bias-free quantum random number generator (QRNG) using photon arrival time selectively in accordance with the number of photon detection events within a sampling time interval in attenuated light. It is well…
Quantum random number generators (QRNGs) are able to generate numbers that are certifiably random, even to an agent who holds some side-information. Such systems typically require that the elements being used are precisely calibrated and…
Device-independent quantum random number generators (DI-QRNGs) are crucial for information processing, ensuring certified quantumness and genuine randomness. However, existing implementations often face low bit rates due to quantumness…
In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an…
Unlike most classical algorithms that take an input and give the solution directly as an output, quantum algorithms produce a quantum circuit that works as an indirect solution to computationally hard problems. In the full quantum computing…
A novel Mathematical Random Number Generator (MRNG) is presented here. In this case, "mathematical" refers to the fact that to construct that generator it is not necessary to resort to a physical phenomenon, such as the thermal noise of an…
Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness--recently proved to be theoretically incomputable--and some well-known computable sources of pseudo-randomness. Incomputability is a…