Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The New Scientist

The random number generator

Michael Brooks

Published Dec 1, 2025• 0 citations
Publisher
DOI
10.1016/s0262-4079(25)02044-5

Related papers

True Random Number Generators

Mario Stipčević, Çetin Kaya Koç

Springer eBooks•Jan 1, 2014•202 citations

Self-correcting random number generator

Travis S. Humble

A system and method for generating random numbers. The system may include a random number generator (RNG), such as a quantum random number generator (QRNG) configured to self-correct or adapt in order to substantially achieve randomness from the output of the RNG. By adapting, the RNG may generate a random number that may be considered random regardless of whether the random number itself is tested as such. As an example, the RNG may include components to monitor one or more characteristics of the RNG during operation, and may use the monitored characteristics as a basis for adapting, or self-correcting, to provide a random number according to one or more performance criteria.

•Jan 23, 2023•0 citations

Physical Random Number Generators

Yuncai Wang

Springer eBooks•Jan 1, 2025•0 citations

Random Number Generation with Chaotic Lasers

Atsushi Uchida

This chapter contains sections titled: Introduction Types of Random Number Generators Examples of Random Number Generators with Chaotic Lasers Application of Chaotic-Laser-Based Random Number Generators to High-Speed Quantum Key Distribution Numerical Evaluation of Random Number Generator as Entropy Source Conventional Methods for Physical Random Number Generators Postprocessing Techniques for Improvement of Randomness Pseudorandom Number Generators Statistical Evaluation of Random Numbers with NIST Special Publication 800-22 Test Suite Appendix

Wiley eBooks•Jan 11, 2012•2 citations

Novel pseudo-random number generator based on quantum random walks

Yu‐Guang Yang, Qianqian Zhao

In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PRNG is subjected to statistical tests such as NIST and successfully passed the test. Compared with the representative PRNG based on quantum chaotic maps (QCM), the present QRWs-based PRNG has some advantages such as better statistical complexity and recurrence. For example, the normalized Shannon entropy and the statistical complexity of the QRWs-based PRNG are 0.999699456771172 and 1.799961178212329e-04 respectively given the number of 8 bits-words, say, 16Mbits. By contrast, the corresponding values of the QCM-based PRNG are 0.999448131481064 and 3.701210794388818e-04 respectively. Thus the statistical complexity and the normalized entropy of the QRWs-based PRNG are closer to 0 and 1 respectively than those of the QCM-based PRNG when the number of words of the analyzed sequence increases. It provides a new clue to construct PRNGs and also extends the applications of quantum computation.

Scientific Reports•Feb 4, 2016•58 citations

Sustainable Pseudo-random Number Generator

Huafei Zhu, Wee-Siong Ng, See-Kiong Ng

IFIP advances in information and communication technology•Jan 1, 2013•0 citations
A system and method for generating random numbers. The system may include a random number generator (RNG), such as a quantum random number generator (QRNG) configured to self-correct or adapt in order to substantially achieve randomness from the output of the RNG. By adapting, the RNG may generate a random number that may be considered random regardless of whether the random number itself is tested as such. As an example, the RNG may include components to monitor one or more characteristics of the RNG during operation, and may use the monitored characteristics as a basis for adapting, or self-correcting, to provide a random number according to one or more performance criteria.
This chapter contains sections titled: Introduction Types of Random Number Generators Examples of Random Number Generators with Chaotic Lasers Application of Chaotic-Laser-Based Random Number Generators to High-Speed Quantum Key Distribution Numerical Evaluation of Random Number Generator as Entropy Source Conventional Methods for Physical Random Number Generators Postprocessing Techniques for Improvement of Randomness Pseudorandom Number Generators Statistical Evaluation of Random Numbers with NIST Special Publication 800-22 Test Suite Appendix
In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PRNG is subjected to statistical tests such as NIST and successfully passed the test. Compared with the representative PRNG based on quantum chaotic maps (QCM), the present QRWs-based PRNG has some advantages such as better statistical complexity and recurrence. For example, the normalized Shannon entropy and the statistical complexity of the QRWs-based PRNG are 0.999699456771172 and 1.799961178212329e-04 respectively given the number of 8 bits-words, say, 16Mbits. By contrast, the corresponding values of the QCM-based PRNG are 0.999448131481064 and 3.701210794388818e-04 respectively. Thus the statistical complexity and the normalized entropy of the QRWs-based PRNG are closer to 0 and 1 respectively than those of the QCM-based PRNG when the number of words of the analyzed sequence increases. It provides a new clue to construct PRNGs and also extends the applications of quantum computation.