We study the importance of the quality of random numbers in Monte Carlo simulations of 2D Ising systems. Simulations are carried out at critical temperature to find the dynamic scaling law of the linear relaxation time. Our aim is to show that statistical correlations that appear in large Ising simulations performed with pseudorandom numbers can be corrected using a quantum random number generator (QRNG). To achieve high speeds and large systems, Ising lattices are simulated on a field programmable gate array (FPGA) with an optical QRNG.
We study the importance of the quality of random numbers in Monte Carlo simulations of 2D Ising systems. Simulations are carried out at critical temperature to find the dynamic scaling law of the linear relaxation time. Our aim is to show that statistical correlations that appear in large Ising simulations performed with pseudorandom numbers can be corrected using a quantum random number generator (QRNG). To achieve high speeds and large systems, Ising lattices are simulated on a field programmable gate array (FPGA) with an optical QRNG.
We discuss the current state of the art of Quantum Random Number Generators (QRNG) and their possible applications in the search for quantum advantages. To this aim, we first discuss a possible way of benchmarking QRNG by applying them to the computation of complicated and hard to realize classical simulations, such as critical dynamics in two-dimensional Ising lattices. These are performed with the help of computing devices based on field-programmable gate arrays (FPGAs) or graphic processing units (GPUs). The results obtained for QRNG are compared with those obtained by classical pseudo-random number generators (PRNG) of various qualities. Monte Carlo simulations of critical dynamics in moderate lattice sizes (128$\times$128) start to be sensitive to the correlations present in pseudo-random numbers sequences, allowing us to detect them. By comparing our analysis with that of Ref. [PRE {\bf 93}, 022113 (2016)], we estimate the requirements for QRNGs in terms of speed, rapidity of access, and efficiency to achieve the objective of quantum advantage with respect to the best PRNGs. We discuss the technical challenges associated with this objective.
We study how the Monte Carlo simulations of the critical dynamics of two-dimensional Ising lattices are affected by the quality (as compared to true randomness) of the pseudo-randomness used in them by computing an observable known to be sensitive to it: the dynamic critical exponent z. To this end, we first present a review of the literature and then perform the same simulations with different pseudo-randomness sources. We control the quality of the random streams by physically reseeding the generators and observe that while the mean value of the measured observable is slightly affected by the correlations within them, its variance does get a severe impact. By studying this affectation and how such pseudo-random streams perform under standard randomness tests based on statistical analysis, we conclude that the new protocol is able to detect other types of correlations and can thus be used as an additional test. On the other hand, we present the first (to the best of our knowledge) computation of the dynamic critical exponent with a perfectly random quantum random number generator (QRNG) and hypothesize that the presented strategy may point toward a route to establish quantum advantage based on the quality of results as complementary to those strategies based on the speed of the computational task.
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.
Random Number Generators (RNGs) are used in various applications, including cryptography, scientific simulations, gaming, and virtual reality. The quality of these random numbers is crucial, especially for computational approaches that rely on unpredictability to produce accurate results. In this thesis, we perform a comprehensive assessment of the quality of a novel Quantum Random Number Generator (QRNG) based on single photon. QRNGs leverage quantum mechanical properties to produce truly random numbers. This ensures high entropy, unpredictability, and security, making QRNGs particularly useful in fields that require high-quality randomness.We evaluate the statistical properties of strings generated by our QRNG and then its practical application by comparing it to traditional Pseudo-Random Number Generators (PRNGs) in Monte Carlo Integration (MCI), a technique that estimates integrals using random sampling. In particular, we use two statistical randomness test suits, namely NIST and Dieharder, to assess the statistical properties of our QRNG. All tests within these tests were passed, confirming that the corresponding QRNG achieves true randomness with sufficient high entropy. Next, we use our QRNG-generated numbers to seed Monte Carlo Integration (MCI) and compare it against results obtained using classical PRNG. The QRNG-based MCI demonstrated more accurate and stable numerical estimates, showing lower error rates and improved convergence compared to PRNG-based simulations.These findings highlight the advantages of QRNGs in enhancing numerical accuracy and computational security. While QRNGs may have slower generation rates than PRNGs, their superior randomness quality allows for more reliable Monte Carlo-based simulations, suggesting that fewer samples may be needed to achieve the same level of accuracy compared to classical PRNGs. This research underscores the potential of QRNG-powered numerical methods, paving the way for their integration into more advanced applications, including scientific computing, financial modeling, and cryptographic security.
Random numbers are an essential resource to many applications, including cryptography and Monte Carlo simulations. Quantum random number generators (QRNGs) represent the ultimate source of randomness, as the numbers are obtained by sampling a physical quantum process that is intrinsically probabilistic. However, they are yet to be widely employed to replace deterministic pseudo random number generators (PRNG) for practical applications. QRNGs are regarded as interesting devices. However, they are slower than PRNGs for simulations and are typically seen as clumsy laboratory prototypes, prone to failures, and unreliable for cryptographic applications. Here, we overcome these limitations and demonstrate a compact and self-contained QRNG capable of generating random numbers at a pace of 8 Gbit/s uninterruptedly for 71 days. During this period, the physical parameters of the quantum process were monitored in real time by self-checking functions implemented in the generator itself. At the same time, the output random numbers were analyzed with the most stringent suites of statistical tests. The analysis shows that the QRNG under test sustained the continuous operation without physical instabilities or hardware failures. At the same time, the output random numbers were analyzed with the most stringent suites of statistical tests, which were passed during the whole operation time. This extensive trial demonstrates the reliability of a robustly designed QRNG and paves the way to its use in practical applications based on randomness.
Quantum random number generators (QRNG) provide quality random numbers, which are essential for cryptography by utilizing the unpredictable nature of quantum mechanics.Advancements in quantum optics made multiple different architectures for these possible.As part of a project aiming to realize a QRNG service, we developed a system capable of providing real-time monitoring and long term data collection while still fulfilling regular processing duties for these devices.In most cases, hardware validation is done by simply running a battery of statistical tests on the final output.Our goal, however, was to create a system allowing more flexible use of these tests, realizing a tool that can also prove useful during the construction of our entropy source for detecting and correcting unique imperfections.We tested this flexibility and the system's ability to adequately perform the required tasks with simulated sources while further examining the usability of available verification tools within this new custom framework.