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

Two Rigorous Statistical Tools for Objective Analysis of Quantum Random Number Generation

Parthasarathy Srinivasan, Tapas Pramanik

Published Jul 30, 2024• 0 citations
Publisher

Abstract

Quantum Random Number generation(Qrng) provides a superior alternative than classical Random Number Generation (Crng) and the two experiments outlined in this work provide validation of this premise. The first experiment utilizes Random Numbers generated using Qrng and CRng to provide data samples as input to an Evolutionary Algorithm (namely Differential Evolution) , which mutates and thresholds these samples using the known rastrigin and rosenbrock functions and evolves the solution pool towards convergence. Rigorous statistical analysis employing p-values is applied to the convergence data to prove that Qrng is indeed Qualitatively superior to Crng (Qrng surpasses Crng by a factor of 2). These results are complemented with yet another experiment wherein the Qrng and Crng samples are generated and statistically compared with,yet another tool namely bottleneck distance , which leads to a logical conclusion consistent with the one obtained in the first experiment (Qrng again surpasses Crng by the same factor of 2 in the range of statistical distances obtained from employing the two Rng methods).

DOI
10.5121/csit.2024.141417

Related papers

Quantum Random Number Generator Probability Analysis and Optimization

Jincheng Zhang

Quantum random number generators (QRNGs) offer a fundamentally different approach to random number generation compared to classical methods, leveraging the inherent randomness of quantum processes. However, their practical implementation and analysis often face challenges, particularly concerning the accurate characterization of the underlying probability distribution and the optimization of generation algorithms. This paper presents a comprehensive probability analysis of QRNG output, focusing on identifying and quantifying sources of bias and uncertainty. We introduce a novel framework combining quantum information theory and statistical analysis to rigorously evaluate QRNG performance. Furthermore, we propose an optimization strategy based on adaptive sampling techniques and error correction, aiming to enhance both the security and efficiency of QRNGs. Our approach provides a detailed understanding of QRNG behavior and offers actionable insights for designing and deploying robust QRNG systems. The core of our analysis lies in the precise determination of the output probability distribution, denoted as P(s1, s2, ..., sK), where K represents the number of bits generated. We demonstrate how this distribution can be refined through iterative statistical estimation and how this information can be used to improve the generation process.

•Sep 2, 2026•0 citations

Single-Photon Quantum Random Number Generator: Evaluation and Application

Al-Sulaiti, Aisha Abdulaziz Th M.

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.

•Jan 1, 2025•0 citations

Quantum Random Number Generator Multi-Model Fusion and Verification

Jincheng Zhang

Quantum random number generators (QRNGs) offer a fundamentally different approach to random number generation compared to classical methods, leveraging the inherent unpredictability of quantum mechanical processes. However, the widespread adoption of QRNGs is currently hindered by a lack of standardized verification procedures and effective multi-model fusion strategies. This paper addresses these challenges by proposing a comprehensive framework for the multi-model validation and fusion of QRNGs. The framework integrates multiple quantum physical and information-theoretic randomness sources, employing statistical modeling for rigorous security assessments. Specifically, we introduce a novel approach to quantifying the entropy and bias of QRNG outputs across various models. The core contribution lies in establishing a systematic methodology for evaluating QRNG security and presenting a viable strategy for combining the strengths of different QRNG technologies. Our analysis highlights the importance of diverse validation techniques and the potential for improved QRNG performance through model fusion. The proposed framework provides a foundation for more reliable and trustworthy QRNG implementations, crucial for applications demanding high-quality randomness, such as cryptography and simulation.

•Sep 2, 2026•0 citations

Construction of a Quantum Random Number Generator

Kashish Karera, Ayan Khan, Humanyou Tariq +4 more

Quantum random number generators (QRNG) are the prime source of randomness, by exploiting the unpredictable nature of Quantum mechanics QRNG aims to provide a string of completely random utterly unpredictable numbers. QRNGs are crucial for cryptography, scientific calculation, simulation, and many more real-world applications. Our Optical Quantum Random Number Generator (OQRNG) utilizes a high-speed pulsating laser, a Polarizing beam splitter (PBS), photodetectors, and advanced signal processing units that capture and digitize random photon intensity forming the raw random bit stream. This technique is famously known as Branching Path Technique. After that, we implement rigorous testing that encompasses the statistical randomness tests developed by National Institute of Standards and Technology (NIST) to ensure the guaranteed ran-domness meets security standards. A user-friendly Graphic user interface (GUI) simplifies interaction with the QRNG allowing the user to configure device settings, monitor system performance, and securely extract random numbers. Our findings help us demonstrate the superiority of QRNGs over classical random number generators, and highlight the potential of photon-based QRNGs and their environmentally friendly and efficient random number generation.

International Conference on Innovations in Computer Science & Software Engineering (ICONICS)•Nov 13, 2024•0 citations

Evaluating quantumness, efficiency and cost of quantum random number generators via photon statistics*

Goutam Paul, Nirupam Basak, Soumya Das

Abstract This work presents two significant contributions from the perspectives of quantum random number generator (QRNG) manufacturers and users. For manufacturers, the conventional method of assessing the quantumness of single-photon-based QRNGs through mean and variance comparisons of photon counts is statistically unreliable due to finite sample sizes. Given the sub-Poissonian statistics of single photons, confirming the underlying distribution is crucial for validating a QRNG’s quantumness. We propose a more efficient two-fold statistical approach to ensure the quantumness of optical sources with the desired confidence level. Additionally, we demonstrate that the output of QRNGs from exponential and uniform distributions exhibits similarity under device noise, deriving corresponding photon statistics and conditions for ε-randomness. From the user’s perspective, the fundamental parameters of a QRNG are quantumness, efficiency (entropy and random number generation rate), and cost. Our analysis reveals that these parameters depend on three factors, namely, expected photon count per unit time, external reference cycle duration, and detection efficiency. A lower expected photon count enhances entropy but increases cost and decreases the generation rate. A shorter external reference cycle boosts entropy but must exceed a minimum threshold to minimize timing errors, with minor impacts on cost and rate. Lower detection efficiency enhances entropy and lowers cost but reduces the generation rate. Finally, to validate our results, we perform statistical tests like NIST, Dieharder, AIS-31, ENT etc over the data simulated with different values of the above parameters. Our findings can empower manufacturers to customize QRNGs to meet user needs effectively.

arXiv:2405.14085•Journal of Optics•Aug 1, 2025•0 citations

Quantum random number generators and their applications in cryptography

Mario Stipčević

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.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 1, 2012•39 citations
Quantum Random Number generation(Qrng) provides a superior alternative than classical Random Number Generation (Crng) and the two experiments outlined in this work provide validation of this premise. The first experiment utilizes Random Numbers generated using Qrng and CRng to provide data samples as input to an Evolutionary Algorithm (namely Differential Evolution) , which mutates and thresholds these samples using the known rastrigin and rosenbrock functions and evolves the solution pool towards convergence. Rigorous statistical analysis employing p-values is applied to the convergence data to prove that Qrng is indeed Qualitatively superior to Crng (Qrng surpasses Crng by a factor of 2). These results are complemented with yet another experiment wherein the Qrng and Crng samples are generated and statistically compared with,yet another tool namely bottleneck distance , which leads to a logical conclusion consistent with the one obtained in the first experiment (Qrng again surpasses Crng by the same factor of 2 in the range of statistical distances obtained from employing the two Rng methods).
Quantum random number generators (QRNGs) offer a fundamentally different approach to random number generation compared to classical methods, leveraging the inherent randomness of quantum processes. However, their practical implementation and analysis often face challenges, particularly concerning the accurate characterization of the underlying probability distribution and the optimization of generation algorithms. This paper presents a comprehensive probability analysis of QRNG output, focusing on identifying and quantifying sources of bias and uncertainty. We introduce a novel framework combining quantum information theory and statistical analysis to rigorously evaluate QRNG performance. Furthermore, we propose an optimization strategy based on adaptive sampling techniques and error correction, aiming to enhance both the security and efficiency of QRNGs. Our approach provides a detailed understanding of QRNG behavior and offers actionable insights for designing and deploying robust QRNG systems. The core of our analysis lies in the precise determination of the output probability distribution, denoted as P(s1, s2, ..., sK), where K represents the number of bits generated. We demonstrate how this distribution can be refined through iterative statistical estimation and how this information can be used to improve the generation process.
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.
Quantum random number generators (QRNGs) offer a fundamentally different approach to random number generation compared to classical methods, leveraging the inherent unpredictability of quantum mechanical processes. However, the widespread adoption of QRNGs is currently hindered by a lack of standardized verification procedures and effective multi-model fusion strategies. This paper addresses these challenges by proposing a comprehensive framework for the multi-model validation and fusion of QRNGs. The framework integrates multiple quantum physical and information-theoretic randomness sources, employing statistical modeling for rigorous security assessments. Specifically, we introduce a novel approach to quantifying the entropy and bias of QRNG outputs across various models. The core contribution lies in establishing a systematic methodology for evaluating QRNG security and presenting a viable strategy for combining the strengths of different QRNG technologies. Our analysis highlights the importance of diverse validation techniques and the potential for improved QRNG performance through model fusion. The proposed framework provides a foundation for more reliable and trustworthy QRNG implementations, crucial for applications demanding high-quality randomness, such as cryptography and simulation.
Quantum random number generators (QRNG) are the prime source of randomness, by exploiting the unpredictable nature of Quantum mechanics QRNG aims to provide a string of completely random utterly unpredictable numbers. QRNGs are crucial for cryptography, scientific calculation, simulation, and many more real-world applications. Our Optical Quantum Random Number Generator (OQRNG) utilizes a high-speed pulsating laser, a Polarizing beam splitter (PBS), photodetectors, and advanced signal processing units that capture and digitize random photon intensity forming the raw random bit stream. This technique is famously known as Branching Path Technique. After that, we implement rigorous testing that encompasses the statistical randomness tests developed by National Institute of Standards and Technology (NIST) to ensure the guaranteed ran-domness meets security standards. A user-friendly Graphic user interface (GUI) simplifies interaction with the QRNG allowing the user to configure device settings, monitor system performance, and securely extract random numbers. Our findings help us demonstrate the superiority of QRNGs over classical random number generators, and highlight the potential of photon-based QRNGs and their environmentally friendly and efficient random number generation.
Abstract This work presents two significant contributions from the perspectives of quantum random number generator (QRNG) manufacturers and users. For manufacturers, the conventional method of assessing the quantumness of single-photon-based QRNGs through mean and variance comparisons of photon counts is statistically unreliable due to finite sample sizes. Given the sub-Poissonian statistics of single photons, confirming the underlying distribution is crucial for validating a QRNG’s quantumness. We propose a more efficient two-fold statistical approach to ensure the quantumness of optical sources with the desired confidence level. Additionally, we demonstrate that the output of QRNGs from exponential and uniform distributions exhibits similarity under device noise, deriving corresponding photon statistics and conditions for ε-randomness. From the user’s perspective, the fundamental parameters of a QRNG are quantumness, efficiency (entropy and random number generation rate), and cost. Our analysis reveals that these parameters depend on three factors, namely, expected photon count per unit time, external reference cycle duration, and detection efficiency. A lower expected photon count enhances entropy but increases cost and decreases the generation rate. A shorter external reference cycle boosts entropy but must exceed a minimum threshold to minimize timing errors, with minor impacts on cost and rate. Lower detection efficiency enhances entropy and lowers cost but reduces the generation rate. Finally, to validate our results, we perform statistical tests like NIST, Dieharder, AIS-31, ENT etc over the data simulated with different values of the above parameters. Our findings can empower manufacturers to customize QRNGs to meet user needs effectively.
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.