The DOI matches its Crossref record; 211 of the 211 references it cites were found in a registry or an index.
A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness
Open accessAbstract
Random numbers are central to cryptography and various other tasks. The intrinsic probabilistic nature of quantum mechanics has allowed us to construct a large number of quantum random number generators (QRNGs) that are distinct from the traditional true number generators. This article provides a review of the existing QRNGs with a focus on their various possible features (e.g., device independence, semi-device independence) that are not achievable in the classical world. It also discusses the origin, applicability, and other facets of randomness. Specifically, the origin of randomness is explored from the perspective of a set of hierarchical axioms for quantum mechanics, implying that succeeding axioms can be regarded as a superstructure constructed on top of a structure built by the preceding axioms. The axioms considered are: (Q1) incompatibility and uncertainty; (Q2) contextuality; (Q3) entanglement; (Q4) non-locality and (Q5) indistinguishability of identical particles. Relevant toy generalized probability theories (GPTs) are introduced, and it is shown that the origin of random numbers in different types of QRNGs known today are associated with different layers of nonclassical theories and all of them do not require all the features of quantum mechanics. Further, classification of the available QRNGs has been done, and the technological challenges associated with each class are critically analyzed. Commercially available QRNGs are also compared.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“mouse motions, keyboard input, disk access, or sudden system interruptions are not guaranteed to be truly random1.”
From Parameterized quantum random number generators for superconducting quantum hardware: novel architectures and NIST SP 800-22 evaluation under IBM noisy simulators (2026) · cites this paper as [1]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“With time the relevance of random numbers has been widened, and new applications of random numbers have been found in weather prediction to Monte Carlo simulation [1–3], cryptography to statistical sampling [4,5].”
Re-epithelialization and immune cell behaviour in an ex vivo human skin model
Rakita, A., Nikolić, N., Mildner, M., Matiasek, J., & Elbe-Bürger, A. (2020) · Scientific Reports · doi:10.1038/s41598-019-56847-4 · Cited by 8,228
Proposed Experiment to Test Local Hidden-Variable Theories
Clauser, J. F., Horne, M. A., Shimony, A., & Holt, R. A. (1969) · Physical Review Letters · doi:10.1103/physrevlett.23.880 · Cited by 7,573 · cited 2×
“[59], based on the Clauser–Horne– Shimony–Holt (CHSH) inequality [178].”
MethodMetropolis, N., & Ulam, S. (1949) · Journal of the American Statistical Association · doi:10.1080/01621459.1949.10483310 · Cited by 6,474
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
Matsumoto, M., & Nishimura, T. (1998) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/272991.272995 · Cited by 5,780 · cited 1×
“One of the most common pseudo-random number generators used in scientific software nowadays is the MT19937, based on Mersenne Twister (linear shift feedback registers [96]) [97], having a period of 219937 − 1.”
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617 · cited 1×
“PRNGs [6, 10, 11] are based on some deterministic algorithms which convert a small input string into a larger set of strings that satisfy specific tests such as NIST test [12], Die-Hard test [13], etc.”
MethodThermal Agitation of Electric Charge in Conductors
Nyquist, H. (1928) · Physical Review · doi:10.1103/physrev.32.110 · Cited by 3,115 · cited 1×
“The noise present in such systems can be broadly classified as shot-noise [113] and thermal noise [114, 115].”
Background
Research works printed but not linked: 24
- Lee, J.S., Cleaver, G.B.: The cosmic microwave background radiation power spectrum as a random bit generator for symmetric- and asymmetric-key cryptography. Heliyon 3(10), e00422 (2017) · DOI
- Zhun, H., Hongyi, C.: A truly random number generator based on thermal noise. In: ASICON 2001. 2001 4th International Conference on ASIC Proceedings (Cat. No.01TH8549), pp. 862-864. IEEE (2001). https://ieeexplore.ieee.org/abstract/document/982700
- Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th, Anniversary Cambridge University Press, Cambridge (2010)
- Yan, Q., Zhao, B., Liao, Q., Zhou, N.: Multi-bit quantum random number generation by measuring positions of arrival photons. Rev. Sci. Instrum. 85(10), 103116 (2014). https://doi.org/10.1063/1.4897485 · DOI
- Jacak, J.E., Jacak, W.A., Donderowicz, W.A., Jacak, L.: Quantum random number generators with entanglement for public randomness testing. Sci. Rep. 10(1), 1–9 (2020)
- Toshiba: https://www.toshiba.eu/pages/eu/Cambridge-Research-Laboratory/quantum-random-number-generators. Accessed on 25 Feb 2022
- Rényi, A.: On Measures of Entropy and Information. In: Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics, vol. 4.1, pp. 547-62. University of California Press, Ewing (1961). https://projecteuclid.org/proceedings/berkeley-symposium-on-mathematical-statistics-and-probability/Proceedings-of-the-Fourth-Berkeley-Symposium-on-Mathematical-Statistics-and/Chapter/On-Measures-of-Entropy-and-Information/bsmsp/1200512181
- Renner, R.: Security of quantum key distribution. ETHZ (2005). http://hdl.handle.net/20.500.11850/72791
- Knuth, D.E.: The art of computer programming, volume 3: (2nd ed) sorting and searching. Addison Wesley Longman Publishing Co. Inc., New York (1998). https://doi.org/10.5555/280635 · doi:10.5555/280635
- Lehmer, D.H.: Mathematical methods in large-scale computing units. Annu. Comput. Lab. Harvard Univ. 26, 141–146 (1951)
- Vazirani, U.V., Vazirani, V.V.: Efficient and secure pseudo-random number generation. In: 25th Annual Symposium on Foundations of Computer Science, pp. 458–463 (1984). IEEE. https://ieeexplore.ieee.org/document/715948 · DOI
- Metropolis, N., Ulam, S.: The Monte Carlo Method. J. Am. Stat. Assoc. 44(247), 335–341 (1949). https://doi.org/10.1080/01621459.1949.10483310 · DOI · Paper page
- Ferguson, N., Schneier, B., Kohno, T.: Cryptography Engineering: Design Principles and Practical Applications. Wiley, Hoboken (2010). https://www.wiley.com/en-be/Cryptography+Engineering:+Design+Principles+and+Practical+Applications+-p-9780470474242
- Stipčević, M.: Quantum random number generators and their use in cryptography. In: 2011 Proceedings of the 34th International Convention MIPRO, pp. 1474–1479. IEEE (2011). https://ieeexplore.ieee.org/document/sps5967293
- Stefanov, A., Gisin, N., Guinnard, O., et al.: Optical quantum random number generator. J. Mod. Opt. 47(4), 595–8 (2000). https://doi.org/10.1080/09500340008233380 · DOI
- Stipčević, M., Rogina, B.M.: Quantum random number generator based on photonic emission in semiconductors. Rev. Sci. Instrum. 78(4), 045104 (2007). https://doi.org/10.1063/1.2720728 · DOI · Paper page
- Xu, H., Perenzoni, D., Tomasi, A., et al.: A $$16\times 16$$ pixel post-processing free quantum random number generator based on SPADs. IEEE Trans. Circuits Syst. II. 65(5), 627–31 (2018)
- Saito, T., Ishii, K., Tatsuno, I., Sukagawa, S., Yanagita, T.: Randomness and genuine random number generator with self-testing functions. SNA + MC2010: Joint international conference of supercomputing in nuclear applications and Monte Carlo. Japan (2010). http://inis.iaea.org/search/search.aspx?orig_q=RN:43020174
- Pironio, S., Acín, A., Massar, S., de la Giroday, A.B., Matsukevich, D.N., Maunz, P., et al.: Random numbers certified by Bell’s theorem. Nature 464(7291), 1021–1024 (2010). https://doi.org/10.1038/nature09008 · DOI · Paper page
- Deng, D.L., Zu, C., Chang, X.Y., et al.: Exploring Quantum Contextuality to Generate True Random Numbers (2013). arXiv:1301.5364v2 · arXiv
- Ambainis, A., Leung, D., Mancinska, L., et al.: Quantum Random Access Codes with Shared Randomness (2008). arXiv:0810.2937v3 · arXiv
- Cao, Z., Zhou, H., Yuan, X., Ma, X.: Source-independent quantum random number generation. Phys. Rev. X. 6, 011020 (2016). https://doi.org/10.1103/PhysRevX.6.011020 · DOI
- Marangon, D.G., Vallone, G., Villoresi, P.: Source-device-independent ultrafast quantum random number generation. Phys. Rev. Lett. 118, 060503 (2017). https://doi.org/10.1103/PhysRevLett.118.060503 · DOI · Paper page
- Zhang, Y., Shalm, L., Bienfang, J., Stevens, M., Mazurek, M., Nam, S., Abellán, C., Amaya, W., Mitchell, M., Fu, H.: Experimental low-latency device-independent quantum randomness. Phys. Rev. Lett. 124, 010505 (2020) · DOI
Cited by
Certified randomness using a trapped-ion quantum processor
Liu, M., Shaydulin, R., Niroula, P., DeCross, M. P., Hung, S.-H., Kon, W. Y., Cervero-Martín, E., Chakraborty, K., Amer, O., Aaronson, S., et al. (2025) · Nature · doi:10.1038/s41586-025-08737-1 · Cited by 56
“Random number generation is a natural task for such a demonstration since randomness is intrinsic to quantum mechanics, and it is important in a broad variety of applications, ranging from information security to ensuring fairness of processes such as jury selection [4, 16–18].”
Lu, Y., & Yang, J. (2024) · Journal of Industrial Information Integration · doi:10.1016/j.jii.2024.100663 · Cited by 51
Blockchain Security Risk Assessment in Quantum Era, Migration Strategies, and Proactive Defense
Baseri, Y., Hafid, A. S., Shahsavari, Y., Makrakis, D., & Khodaiemehr, H. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3621113 · Cited by 33
“While traditional RNGs might suffice currently, they could be vulnerable to manipulation by quantum computers [174], [175].”
Adil, M., Ali, A., Tin, T. T., Abulkasim, H., Farouk, A., Al-Kuwari, S. M., Song, H., & Jin, Z. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3605040 · Cited by 22
“Quantum random number generators (QRNGs) are used to solve different vulnerabilities in emerging technologies [145].”
Source-independent quantum random number generators with integrated silicon photonics
Du, Y., Hua, X., Zhao, Z., Sun, X., Zhang, Z., Xiao, X., & Wei, K. (2025) · Communications Physics · doi:10.1038/s42005-024-01917-x · Cited by 20
Metadata
- Authors
- Mannalath, V., Mishra, S., & Pathak, A.
- Affiliations
- Jaypee Institute of Information Technology (IN)
- Corresponding author
- Mishra, Sandeep
- Pathak, Anirban
- Venue
- Quantum Information Processing
- Published
- 2023-12-13
- Volume
- 22
- Issue
- 12
- ISSN
- 1570-0755 (ISSN-L)
- 1573-1332
- OpenAlex
- W4389681520
- Cited by
- 125
- References
- 202
- Citations by year
- 2026: 27 · 2025: 49 · 2024: 35 · 2023: 12
- FWCI
- 10.61
- Type
- journal article
- Language
- en
- Update notices
- correction (2026-05-22)
- Open access
- green
- arxiv.org
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Quantum Information Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- DST (DST/ICPS/QuST/Theme-1/2019/14 (Q80))
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Keywords
- quantum random number generators, randomness, device independence, axiomatic quantum mechanics, contextuality, entanglement, nonlocality, generalized probability theory, toy model, cryptography
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness. https://app.cochat.ai/papers/10.1007/s11128-023-04175-y
- The paper
- Mannalath, V., Mishra, S., & Pathak, A. (2023). A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness. Quantum Information Processing. https://doi.org/10.1007/s11128-023-04175-y
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.