Related papers: Employing online quantum random number generators …
Hybrid quantum-classical algorithms appear to be the most promising approach for near-term quantum applications. An important bottleneck is the classical optimization loop, where the multiple local minima and the emergence of barren…
Quantum random number generators (QRNGs) harness the intrinsic randomness in measurement processes: the measurement outputs are truly random given the input state is a superposition of the eigenstates of the measurement operators. In the…
A cloud quantum computer is similar to a random number generator in that its physical mechanism is inaccessible to its users. In this respect, a cloud quantum computer is a black box. In both devices, its users decide the device condition…
Random number generation is an enabling technology for fields as varied as Monte Carlo simulations and quantum information science. An important application is a secure quantum key distribution (QKD) system; here, we propose and demonstrate…
Ideal quantum random number generators (QRNGs) can produce algorithmically random and thus incomputable sequences, in contrast to pseudo-random number generators. However, the verification of the presence of algorithmic randomness and…
Quantum coherence serves as a fundamental resource for generating intrinsic randomness, yet the quantification of randomness in quantum random number generators (QRNGs) based on spontaneous emission has remained largely phenomenological.…
Classical computation of electronic properties in large-scale materials remains challenging. Quantum computation has the potential to offer advantages in memory footprint and computational scaling. However, general and practical quantum…
We present the Random Permutation Sorting System (RPSS), a novel framework for true uniform randomness generation grounded in statistical quantum mechanics. RPSS is built on a pair of conjugate observables, the permutation count and the…
Quantum random number generators (QRNG) are based on the naturally random measurement results performed on individual quantum systems. Here, we demonstrate a branching-path photonic QRNG implemented with a Sagnac interferometer with a…
Pseudo-random number generators (PRNGs) are essential in a wide range of applications, from cryptography to statistical simulations and optimization algorithms. While uniform randomness is crucial for security-critical areas like…
The semi-source independent quantum walk random number generator (SI-QW-QRNG) is a cryptographic protocol that extracts a string of true random bits from a quantum random walk with an adversary controls a randomness source, but the…
It has been proven that Boson sampling is a much promising model of optical quantum computation, which has been applied to designing quantum computer successfully, such as "Jiuzhang". However, the meaningful randomness of Boson sampling…
As we enter a new era of quantum technology, it is increasingly important to develop methods to aid in the accurate preparation of quantum states for a variety of materials, matter, and devices. Computational techniques can be used to…
Quantum random number generators (QRNGs) can provide genuine randomness based on the inherent unpredictable nature of quantum physics. The extracted randomness relies not only on the physical parts of the QRNG, such as the entropy source…
Random Number Generators are critical components of modern cryptosystems. Quantum Random Number Generators (QRNG) have emerged to provide high-quality randomness for these applications. Here we describe a scheme to extract random numbers…
We introduce the Romu family of pseudo-random number generators (PRNGs) which combines the nonlinear operation of rotation with the linear operations of multiplication and (optionally) addition. Compared to conventional linear-only PRNGs,…
We describe a methodology and standard of proof for experimental claims of quantum random number generation (QRNG), analogous to well-established methods from precision measurement. For appropriately constructed physical implementations,…
Random numbers are required for a variety of applications from secure communications to Monte-Carlo simulation. Yet randomness is an asymptotic property and no output string generated by a physical device can be strictly proven to be…
Quantum computing offers the potential for computational abilities that can go beyond classical machines. However, they are still limited by several challenges such as noise, decoherence, and gate errors. As a result, efficient classical…
Random number generators (RNGs) are notoriously challenging to build and test, especially for cryptographic applications. While statistical tests cannot definitively guarantee an RNG's output quality, they are a powerful verification tool…