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

Quantum random number characterization via quantum inspired machine learning

Tommaso Faorlin

Published Oct 1, 2020• 0 citations
OpenAlex

Abstract

The generation of good random numbers impacts basic research and applications beyond pure academic interests: random numbers are required for countless applications, such as cryptography and simulations. For most applications, it is of outmost importance to know if a set of numbers is truly random, pseudo-random or contains some residual correlations. Tensor networks are powerful data structures that spring from quantum many-body physics and are now increasingly applied to machine learning applications. This thesis plans to explore the intersection between these two fields, applying quantum-inspired machine learning to random number generation. We aim to perform and characterise novel statistical checks comparing and characterising the statistical quality of different number sets: correlated, pseudo-random, and quantum-random.

Related papers

Theory, Methods and Tools for Statistical Testing of Pseudo and Quantum Random Number Generators

Krister Sune Jakobsson

Statistical random number testing is a well studied field focusing on pseudo-random number generators, that is to say algorithms that produce random-looking sequences of numbers. These generators tend to have certain kinds of flaws, which have been exploited through rigorous testing. Such testing has led to advancements, and today pseudo random number generators are both very high-speed and produce seemingly random numbers. Recent advancements in quantum physics have opened up new doors, where products called quantum random number generators that produce acclaimed true randomness have emerged. Of course, scientists want to test such randomness, and turn to the old tests used for pseudo random number generators to do this. The main question this thesis seeks to answer is if publicly available such tests are good enough to evaluate a quantum random number generator. We also seek to compare sequences from such generators with those produced by state of the art pseudo random number generators, in an attempt to compare their quality. Another potential problem with quantum random number generators is the possibility of them breaking without the user knowing. Such a breakdown could have dire consequences. For example, if such a generator were to control the output of a slot machine, an malfunction could cause the machine to generate double earnings for a player compared to what was planned. Thus, we look at the possibilities to implement live tests to quantum random number generators, and propose such tests. Our study has covered six commonly available tools for random number testing, and we show that in particular one of these stands out in that it has a series of tests that fail our quantum random number generator as not random enough, despite passing an pseudo random number generator. This implies that the quantum random number generator behave differently from the pseudo random number ones, and that we need to think carefully about how we test, what we expect from an random sequence and what we want to use it for.

•Jan 1, 2014•8 citations

Quantum Random Numbers: A Survey on Sources, Numerical Evidence, and Applications in Security and Computing

Sebastian Raubitzek, Stefan Mühlhauser, Kevin Mallinger

Random numbers are used to generate cryptographic keys, to run Monte Carlo simulations, and to train and sample machine learning models. Most software obtains them from deterministic pseudo-random number generators, which have good statistical properties but are predictable once their internal state is known. Quantum random number generators take their output from measurements on quantum systems, whose outcomes are not fixed by any prior state of the device. This article introduces the types of random number generators, reviews studies that compare quantum and pseudo-random numbers in numerical experiments, and lists the sources of randomness available in current computing systems. It then describes applications of quantum randomness in security, hashing, software, artificial intelligence, and public randomness. The quality of encryption is treated as depending on three factors: the algorithm, its implementation, and the randomness of keys and other security-relevant values. We give arguments for which applications benefit from quantum randomness, name further areas in which it could be tested, and outline next steps.

Entropy•Nov 10, 2026•0 citations

Machine Learning Cryptanalysis of a Quantum Random Number Generator

Nhan Duy Truong, Jing Yan Haw, Syed M. Assad +2 more

Random number generators (RNGs) that are crucial for cryptographic applications have been the subject of adversarial attacks. These attacks exploit environmental information to predict generated random numbers that are supposed to be truly random and unpredictable. Though quantum random number generators (QRNGs) are based on the intrinsic indeterministic nature of quantum properties, the presence of classical noise in the measurement process compromises the integrity of a QRNG. In this paper, we develop a predictive machine learning (ML) analysis to investigate the impact of deterministic classical noise in different stages of an optical continuous variable QRNG. Our ML model successfully detects inherent correlations when the deterministic noise sources are prominent. After appropriate filtering and randomness extraction processes are introduced, our QRNG system, in turn, demonstrates its robustness against ML. We further demonstrate the robustness of our ML approach by applying it to uniformly distributed random numbers from the QRNG and a congruential RNG. Hence, our result shows that ML has potentials in benchmarking the quality of RNG devices.

arXiv:1905.02342•IEEE Transactions on Information Forensics and Security•Jun 26, 2018•70 citations

Distinction for Quantum Random Number Generators Based on Machine Learning

Yu Han, Tao Pei, Feng Zhang

Randomness is crucial for our understanding of nature and indispensable in information processing tasks. In practical applications, assessing the quality of random numbers is crucial—particularly in cryptographic applications, where random numbers must exhibit statistical uniformity. Various statistical estimation methods have been developed to test the statistical characteristics of generated random numbers, enabling comprehensive evaluation of their statistical uniformity from multiple perspectives. Despite recent advances in quantum information providing physically well-characterized models for randomness quantification, distinction between different types of random numbers (including quantum random numbers) remains a challenging task, and statistical uniformity is rarely directly applicable to such discrimination scenarios. With the development of artificial intelligence technologies, the problem of random number discrimination is expected to draw on the paradigm of image classification in computer vision. This research proposes a machine learning-based randomness discrimination method, specifically addressing the challenge of quantum random number identification. Specifically, we design an image-based convolutional neural network (CNN) approach: one-dimensional random number sequences are converted into two-dimensional grayscale images, and binary classification of these images is achieved by capturing high-dimensional latent features that are undetectable via traditional statistical tests, thereby enabling effective random number discrimination. Experimental results demonstrate that, for the selected quantum random numbers, the proposed discrimination method successfully achieves two key distinctions: (1) between raw quantum random numbers and classical random numbers; and (2) between raw quantum random numbers and post-processed quantum random numbers—additionally revealing the role of statistical uniformity in these discrimination tasks. This achievement provides significant support for the design of randomness extraction protocols and the security assessment of quantum random number generators.

Electronics•Feb 27, 2026•3 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

Machine learning and quantum computing

BORDONI, SIMONE

This thesis presents original contributions at the intersection of quantum computing and machine learning, investigating how these two fields can benefit from each other. The first part of the thesis presents two applications of machine learning techniques in quantum computing. The first contribution involves the use of artificial neural networks for the decoding of quantum error correction codes, resulting in faster decoding times while maintaining a high level of accuracy. The originality of this work lies in the application of explainable machine learning techniques to both improve the decoding performance and to provide insights into the decoding process. The second contribution introduces a novel technique based on reinforcement learning to characterize and simulate the noise affecting a quantum chip. This technique reduces the heuristic assumption on the noise model, making it more adaptable to the specific noise characteristics of the quantum device. In the second part of the thesis, we demonstrate, with two examples, how it is possible to implement machine learning algorithms on quantum devices by replacing artificial neural networks with parametrized quantum circuits. The first contribution in this section introduces a quantum anomaly detection algorithm, applied to the field of high-energy physics. This algorithm allows for the identification of anomalous patterns in quantum data, maintaining a level of accuracy comparable to classical algorithms. The novelty of this work lies in the first use of quantum circuits for the task of anomaly detection in a muon drift chamber trigger system, with possible future applications to quantum detector systems in high-energy physics experiments. The second contribution presents the quantum version of a generative diffusion model, able to sample quantum states from a well-defined distribution. This first implementation of a quantum diffusion model is not meant to outperform classical models, but rather to show potential advantages and limitations of these kinds of algorithms. The aim of the thesis is to show how quantum computing can benefit from machine learning, and how machine learning can be implemented on quantum devices, setting the stage for future advancements in both fields.

•Sep 25, 2025•0 citations
The generation of good random numbers impacts basic research and applications beyond pure academic interests: random numbers are required for countless applications, such as cryptography and simulations. For most applications, it is of outmost importance to know if a set of numbers is truly random, pseudo-random or contains some residual correlations. Tensor networks are powerful data structures that spring from quantum many-body physics and are now increasingly applied to machine learning applications. This thesis plans to explore the intersection between these two fields, applying quantum-inspired machine learning to random number generation. We aim to perform and characterise novel statistical checks comparing and characterising the statistical quality of different number sets: correlated, pseudo-random, and quantum-random.
Statistical random number testing is a well studied field focusing on pseudo-random number generators, that is to say algorithms that produce random-looking sequences of numbers. These generators tend to have certain kinds of flaws, which have been exploited through rigorous testing. Such testing has led to advancements, and today pseudo random number generators are both very high-speed and produce seemingly random numbers. Recent advancements in quantum physics have opened up new doors, where products called quantum random number generators that produce acclaimed true randomness have emerged. Of course, scientists want to test such randomness, and turn to the old tests used for pseudo random number generators to do this. The main question this thesis seeks to answer is if publicly available such tests are good enough to evaluate a quantum random number generator. We also seek to compare sequences from such generators with those produced by state of the art pseudo random number generators, in an attempt to compare their quality. Another potential problem with quantum random number generators is the possibility of them breaking without the user knowing. Such a breakdown could have dire consequences. For example, if such a generator were to control the output of a slot machine, an malfunction could cause the machine to generate double earnings for a player compared to what was planned. Thus, we look at the possibilities to implement live tests to quantum random number generators, and propose such tests. Our study has covered six commonly available tools for random number testing, and we show that in particular one of these stands out in that it has a series of tests that fail our quantum random number generator as not random enough, despite passing an pseudo random number generator. This implies that the quantum random number generator behave differently from the pseudo random number ones, and that we need to think carefully about how we test, what we expect from an random sequence and what we want to use it for.
Random numbers are used to generate cryptographic keys, to run Monte Carlo simulations, and to train and sample machine learning models. Most software obtains them from deterministic pseudo-random number generators, which have good statistical properties but are predictable once their internal state is known. Quantum random number generators take their output from measurements on quantum systems, whose outcomes are not fixed by any prior state of the device. This article introduces the types of random number generators, reviews studies that compare quantum and pseudo-random numbers in numerical experiments, and lists the sources of randomness available in current computing systems. It then describes applications of quantum randomness in security, hashing, software, artificial intelligence, and public randomness. The quality of encryption is treated as depending on three factors: the algorithm, its implementation, and the randomness of keys and other security-relevant values. We give arguments for which applications benefit from quantum randomness, name further areas in which it could be tested, and outline next steps.
Random number generators (RNGs) that are crucial for cryptographic applications have been the subject of adversarial attacks. These attacks exploit environmental information to predict generated random numbers that are supposed to be truly random and unpredictable. Though quantum random number generators (QRNGs) are based on the intrinsic indeterministic nature of quantum properties, the presence of classical noise in the measurement process compromises the integrity of a QRNG. In this paper, we develop a predictive machine learning (ML) analysis to investigate the impact of deterministic classical noise in different stages of an optical continuous variable QRNG. Our ML model successfully detects inherent correlations when the deterministic noise sources are prominent. After appropriate filtering and randomness extraction processes are introduced, our QRNG system, in turn, demonstrates its robustness against ML. We further demonstrate the robustness of our ML approach by applying it to uniformly distributed random numbers from the QRNG and a congruential RNG. Hence, our result shows that ML has potentials in benchmarking the quality of RNG devices.
Randomness is crucial for our understanding of nature and indispensable in information processing tasks. In practical applications, assessing the quality of random numbers is crucial—particularly in cryptographic applications, where random numbers must exhibit statistical uniformity. Various statistical estimation methods have been developed to test the statistical characteristics of generated random numbers, enabling comprehensive evaluation of their statistical uniformity from multiple perspectives. Despite recent advances in quantum information providing physically well-characterized models for randomness quantification, distinction between different types of random numbers (including quantum random numbers) remains a challenging task, and statistical uniformity is rarely directly applicable to such discrimination scenarios. With the development of artificial intelligence technologies, the problem of random number discrimination is expected to draw on the paradigm of image classification in computer vision. This research proposes a machine learning-based randomness discrimination method, specifically addressing the challenge of quantum random number identification. Specifically, we design an image-based convolutional neural network (CNN) approach: one-dimensional random number sequences are converted into two-dimensional grayscale images, and binary classification of these images is achieved by capturing high-dimensional latent features that are undetectable via traditional statistical tests, thereby enabling effective random number discrimination. Experimental results demonstrate that, for the selected quantum random numbers, the proposed discrimination method successfully achieves two key distinctions: (1) between raw quantum random numbers and classical random numbers; and (2) between raw quantum random numbers and post-processed quantum random numbers—additionally revealing the role of statistical uniformity in these discrimination tasks. This achievement provides significant support for the design of randomness extraction protocols and the security assessment of quantum random number generators.
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.
This thesis presents original contributions at the intersection of quantum computing and machine learning, investigating how these two fields can benefit from each other. The first part of the thesis presents two applications of machine learning techniques in quantum computing. The first contribution involves the use of artificial neural networks for the decoding of quantum error correction codes, resulting in faster decoding times while maintaining a high level of accuracy. The originality of this work lies in the application of explainable machine learning techniques to both improve the decoding performance and to provide insights into the decoding process. The second contribution introduces a novel technique based on reinforcement learning to characterize and simulate the noise affecting a quantum chip. This technique reduces the heuristic assumption on the noise model, making it more adaptable to the specific noise characteristics of the quantum device. In the second part of the thesis, we demonstrate, with two examples, how it is possible to implement machine learning algorithms on quantum devices by replacing artificial neural networks with parametrized quantum circuits. The first contribution in this section introduces a quantum anomaly detection algorithm, applied to the field of high-energy physics. This algorithm allows for the identification of anomalous patterns in quantum data, maintaining a level of accuracy comparable to classical algorithms. The novelty of this work lies in the first use of quantum circuits for the task of anomaly detection in a muon drift chamber trigger system, with possible future applications to quantum detector systems in high-energy physics experiments. The second contribution presents the quantum version of a generative diffusion model, able to sample quantum states from a well-defined distribution. This first implementation of a quantum diffusion model is not meant to outperform classical models, but rather to show potential advantages and limitations of these kinds of algorithms. The aim of the thesis is to show how quantum computing can benefit from machine learning, and how machine learning can be implemented on quantum devices, setting the stage for future advancements in both fields.