Review of High-Quality Random Number Generators

@article{James2019ReviewOH,
  title={Review of High-Quality Random Number Generators},
  author={F. James and L. Moneta},
  journal={Computing and Software for Big Science},
  year={2019},
  volume={4},
  pages={1-12}
}
  • F. James, L. Moneta
  • Published 2019
  • Computer Science, Physics
  • Computing and Software for Big Science
This is a review of pseudorandom number generators (RNG’s) of the highest quality, suitable for use in the most demanding Monte Carlo calculations. All the RNG’s we recommend here are based on the Kolmogorov–Anosov theory of mixing in classical mechanical systems, which guarantees under certain conditions and in certain asymptotic limits, that points on the trajectories of these systems can be used to produce random number sequences of exceptional quality. We outline this theory of mixing and… Expand
On protocols for increasing the uniformity of random bits generated with noisy quantum computers
TLDR
This work proposes and analyses two protocols that can be used to increase the uniformity of the bits obtained when running a circuit with a Hadamard gate and a measurement in a noisy quantum computer, and suggests that these protocols are useful to improve the probability of the generated bits passing statistical tests for uniformity. Expand
On the effects of biased quantum random numbers on the initialization of artificial neural networks
Recent advances in practical quantum computing have led to a variety of cloud-based quantum computing platforms that allow researchers to evaluate their algorithms on noisy intermediate-scale quantumExpand
Parallel Random Number Generator
The purpose of this paper is to investigate a pseudo-random number generation technique known as Linear Feedback Shift Registers (LFSR). This random number generator is implemented using a standardExpand
Stochastic Properties of Confidence Ellipsoids after Least Squares Adjustment, Derived from GUM Analysis and Monte Carlo Simulations
In this paper stochastic properties are discussed for the final results of the application of an innovative approach for uncertainty assessment for network computations, which can be characterized asExpand
Co-simulation of linear congruential generator by using Xilinx system generator and MATLAB Simulink
Received May 12, 2020 Revised Aug 8, 2020 Accepted Jan 10, 2021 Arbitrary numerals are utilized in a wide range of uses. Genuine arbitrary numeral generators are moderate and costly for someExpand
A trustless decentralized protocol for distributed consensus of public quantum random numbers
Quantum random number (QRNG) beacons distinguish themselves from classical counterparts by providing intrinsic unpredictability originating from the fundamental laws of quantum mechanics. MostExpand
A Portable Implementation of RANLUX++
High energy physics has a constant demand for random number generators (RNGs) with high statistical quality. In this paper, we present ROOT’s implementation of the RANLUX++ generator. We discuss theExpand
Achieving near native runtime performance and cross-platform performance portability for random number generation through SYCL interoperability
High-performance computing (HPC) is a major driver accelerating scientific research and discovery, from quantum simulations to medical therapeutics. The growing number of new HPC systems comingExpand
A Complete Bibliography of Publications in Computing and Software for Big Science
Calorimeter [17]. Carlo [38]. Cascades [15]. Centers [47]. CephFS [49]. CERN [47, 16]. Challenges [28]. Characteristics [9]. Cherenkov [38]. Classification [35, 2, 25, 42]. Cloud [33, 6].Expand
Challenges in Monte Carlo Event Generator Software for High-Luminosity LHC
We review the main software and computing challenges for the Monte Carlo physics event generators used by the LHC experiments, in view of the High-Luminosity LHC (HL-LHC) physics programme. ThisExpand

References

SHOWING 1-10 OF 29 REFERENCES
The MIXMAX random number generator
  • K. Savvidy
  • Mathematics, Computer Science
  • Comput. Phys. Commun.
  • 2015
TLDR
This paper provides a solution to the problem of determining the maximal period of unimodular matrix generators of pseudo-random numbers, formulate the necessary and sufficient condition to attain the maximum period, and presents a family of specific generators in the MIXMAX family with superior performance and excellent statistical properties. Expand
RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher
TLDR
A portable Fortran 77 implementation of a high-quality generator called RANLUX (for LUXury RANdom numbers), using the algorithm of Martin Luscher described in an accompanying article. Expand
Anosov C-systems and random number generators
We further develop our previous proposal to use hyperbolic Anosov C-systems to generate pseudorandom numbers and to use them for efficient Monte Carlo calculations in high energy particle physics.Expand
Spectral Analysis of the MIXMAX Random Number Generators
TLDR
It is shown that for coordinates at specific lags not too far apart, in three dimensions, all the nonzero points lie in only two hyperplanes, reminiscent of the behavior of lagged-Fibonacci and AWC/SWB generators. Expand
Spectral test of the MIXMAX random number generators
Abstract An important statistical test on the pseudo-random number generators is called the spectral test. The test is aimed at answering the question of distribution of the generated pseudo-randomExpand
A revision of the subtract-with-borrow random number generators
TLDR
The most popular and widely used subtract-with-borrow generator, also known as RANLUX, is reimplemented as a linear congruential generator using large integer arithmetic with the modulus size of 576 bits to show a significant gain in generation speed. Expand
Spectrum and entropy of C-systems MIXMAX random number generator
Abstract The uniformly hyperbolic Anosov C-systems defined on a torus have very strong instability of their trajectories, as strong as it can be in principle. These systems have exponentialExpand
On the lattice structure of the add-with-carry and subtract-with-borrow random number generators
TLDR
It is shown that these sequences are essentially equivalent to linear congruential sequences with very large prime moduli, and how the equivalence can be exploited to implement efficient jumping-ahead facilities for the AWC and SWB sequences. Expand
TestU01: A C library for empirical testing of random number generators
We introduce TestU01, a software library implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators (RNGs).Expand
The RANLUX Generator: Resonances in a Random Walk Test
Using a recently proposed directed random walk test, we systematically investigate the popular random number generator RANLUX developed by Luscher and implemented by James. We confirm the goodExpand
...
1
2
3
...