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

arXiv:2506.02441 · The European Physical Journal Plus

Quantum Random Number Generator (QRNG): theoretical and experimental investigations

Z Haider, Muhammad Haroon Saeed, Muhammad Zaheer, Zeeshan Ahmed Alvi, Muhammad Ilyas, Tahira Nasreen, Muhammad Imran, Rameez‐ul Islam, Manzoor Ikram

Published Sep 11, 2023• 15 citations
arXivHTMLPDF
DOI
10.1140/epjp/s13360-023-04421-3

Related papers

A Bias-Free Quantum Random Number Generation Using Photon Arrival Time Selectively

Jian-min Wang, Tianyu Xie, Hongfei Zhang +3 more

We present a high-quality bias-free quantum random number generator (QRNG) using photon arrival time selectively, in accordance with the number of photon detection events within a sampling time interval in attenuated light. It is well shown in both theoretical analysis and experimental verification that this random number production method eliminates both bias and correlation perfectly without more postprocessing and that the random number can clearly pass the standard randomness tests. We fulfill theoretical analysis and experimental verification of the method whose rate can reach up to 45 Mb/s.

arXiv:1412.0171•IEEE photonics journal•Feb 10, 2015•302 citations

Study of quantum random number generators

Patrik Mäki

•May 15, 2021•0 citations

Algorithmic Randomness and Quantum Random Number Generation

José Manuel Agüero Trejo

In this Thesis, we develop the only class of QRNGs, to date, that has been proved to be better than any PRNG. This type of QRNG is based on a located form of the Kochen-Specker Theorem. This certification is unique because i) the assumptions used have been experimentally validated, ii) the robustness of measurements was proved theoretically, iii) the quality of quantum random digits generated with this class of QRNG was experimentally shown to be better than that of the best PRNGs, demonstrating for the first time the strong effects of incomputability on the outputs of a quantum random number generator. Finally, we propose a method using high-quality randomness for inverting a class of one-way functions in a pre-given time.

•Jan 1, 2024•0 citations

Quantum Random Number Generation: Theory and Practice

Christian Kollmitzer, Stefan Schauer, Stefan Raß +1 more

Quantum science and technology•Jan 1, 2020•22 citations

Quantum Random Number Generation

Christian Kollmitzer, Stefan Petscharnig, Martin Suda +1 more

Quantum science and technology•Jan 1, 2020•10 citations

Experimentally probing the algorithmic randomness and incomputability of quantum randomness

Alastair A. Abbott, Cristian S Calude, Michael J Dinneen +1 more

Abstract The advantages of quantum random number generators (QRNGs) over pseudo-random number generators (PRNGs) are normally attributed to the nature of quantum measurements. This is often seen as implying the superiority of the sequences of bits themselves generated by QRNGs, despite the absence of empirical tests supporting this. Nonetheless, one may expect sequences of bits generated by QRNGs to have properties that pseudo-random sequences do not; indeed, pseudo-random sequences are necessarily computable, a highly nontypical property of sequences. In this paper, we discuss the differences between QRNGs and PRNGs and the challenges involved in certifying the quality of QRNGs theoretically and testing their output experimentally. While QRNGs are often tested with standard suites of statistical tests, such tests are designed for PRNGs and only verify statistical properties of a QRNG, but are insensitive to many supposed advantages of QRNGs. We discuss the ability to test the incomputability and algorithmic complexity of QRNGs. While such properties cannot be directly verified with certainty, we show how one can construct indirect tests that may provide evidence for the incomputability of QRNGs. We use these tests to compare various PRNGs to a QRNG, based on superconducting transmon qutrits and certified by the Kochen–Specker theorem, to see whether such evidence can be found in practice. While our tests fail to observe a strong advantage of the quantum random sequences due to algorithmic properties, the results are nonetheless informative: some of the test results are ambiguous and require further study, while others highlight difficulties that can guide the development of future tests of algorithmic randomness and incomputability.

arXiv:1806.08762•Physica Scripta•Nov 23, 2018•28 citations
We present a high-quality bias-free quantum random number generator (QRNG) using photon arrival time selectively, in accordance with the number of photon detection events within a sampling time interval in attenuated light. It is well shown in both theoretical analysis and experimental verification that this random number production method eliminates both bias and correlation perfectly without more postprocessing and that the random number can clearly pass the standard randomness tests. We fulfill theoretical analysis and experimental verification of the method whose rate can reach up to 45 Mb/s.
In this Thesis, we develop the only class of QRNGs, to date, that has been proved to be better than any PRNG. This type of QRNG is based on a located form of the Kochen-Specker Theorem. This certification is unique because i) the assumptions used have been experimentally validated, ii) the robustness of measurements was proved theoretically, iii) the quality of quantum random digits generated with this class of QRNG was experimentally shown to be better than that of the best PRNGs, demonstrating for the first time the strong effects of incomputability on the outputs of a quantum random number generator. Finally, we propose a method using high-quality randomness for inverting a class of one-way functions in a pre-given time.
Abstract The advantages of quantum random number generators (QRNGs) over pseudo-random number generators (PRNGs) are normally attributed to the nature of quantum measurements. This is often seen as implying the superiority of the sequences of bits themselves generated by QRNGs, despite the absence of empirical tests supporting this. Nonetheless, one may expect sequences of bits generated by QRNGs to have properties that pseudo-random sequences do not; indeed, pseudo-random sequences are necessarily computable, a highly nontypical property of sequences. In this paper, we discuss the differences between QRNGs and PRNGs and the challenges involved in certifying the quality of QRNGs theoretically and testing their output experimentally. While QRNGs are often tested with standard suites of statistical tests, such tests are designed for PRNGs and only verify statistical properties of a QRNG, but are insensitive to many supposed advantages of QRNGs. We discuss the ability to test the incomputability and algorithmic complexity of QRNGs. While such properties cannot be directly verified with certainty, we show how one can construct indirect tests that may provide evidence for the incomputability of QRNGs. We use these tests to compare various PRNGs to a QRNG, based on superconducting transmon qutrits and certified by the Kochen–Specker theorem, to see whether such evidence can be found in practice. While our tests fail to observe a strong advantage of the quantum random sequences due to algorithmic properties, the results are nonetheless informative: some of the test results are ambiguous and require further study, while others highlight difficulties that can guide the development of future tests of algorithmic randomness and incomputability.