Skip to main content
Log in

New concepts and construction of quantum random number generators

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

A new concept of a quantum random number generator related to the application of a quantum entanglement to produce several mutually coupled in a random manner bit strings is proposed. This allows for an entropy assessment in real time in the public domain by testing of one disclosed string without compromising the coupled by quantum entanglement dual strings remaining fully secret and as random as the one tested. Additionally, a new prototype of a miniaturized quantum random number generator is presented, which utilizes quantum transitions along the Fermi golden rule as the entropy source and is developed for an application to reduce size of cryptography systems on continuous variables and for a usage in portable IT devices.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Data Availability

All data are available within the manuscript.

References

  1. Portmann, C., Renner, R.: Security in quantum cryptography. Rev. Mod. Phys. 94, 025008 (2022)

    Article  ADS  MathSciNet  Google Scholar 

  2. Grasselli, F.: Quantum Cryptography: From Key Distribution to Conference Key Agreement. Springer Nature Switzerland AG, Cham (2021)

    Book  Google Scholar 

  3. Jacak, M., Jóźwiak, I., Jacak, J., Gruber, J., Jacak, W.: Introduction to Quantum Cryptography. WUST UP, Wrocław (2013)

    Google Scholar 

  4. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)

    Google Scholar 

  5. Kolmogorov, A.: On tables of random numbers. Theor. Comput. Sci. 207, 387 (1998)

    Article  MathSciNet  Google Scholar 

  6. Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15, 364 (1986)

    Article  MathSciNet  Google Scholar 

  7. Trevisan, L.: Extractors and pseudorandom generators. J. ACM 48, 860 (2001)

    Article  MathSciNet  Google Scholar 

  8. Uchida, A., Amano, K., Inoue, M., Hirano, K., Naito, S., Someya, H., Oowada, I., Kurashige, T., Shiki, M., Yoshimori, S., Yoshimura, K., Davis, P.: Fast physical random bit generation with chaotic semiconductor lasers. Nat. Photon. 2, 728 (2008)

    Article  ADS  Google Scholar 

  9. Ma, X., Yuan, X., Cao, Z., Qi, B., Zhang, Z.: Quantum random number generation. Nat. Electron. (2016)

  10. Rukhin, A., Soto, J., Nechvatal, J., Smid, M. , Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., Vo, S.: A statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST Special Publication 800-22 Revision 1a, 2010. Revisor: Lawrence E. Bassham III

  11. Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, New York (1986)

    Book  Google Scholar 

  12. Collantes, H., Escartin, M.G., Carlos, J.: Quantum random number generators. Rev. Mod. Phys. 89, 015004 (2017)

    Article  ADS  MathSciNet  Google Scholar 

  13. Ma, X., Yuan, X., Cao, Z., Qi, B., Zhang, Z.: Quantum random number generation. Quantum Inf. 2, 16021 (2016)

    Article  Google Scholar 

  14. Khrennikov, A.: Randomness: quantum versus classical. Int. J. Quantum Inform. 14, 1640009 (2016)

    Article  ADS  MathSciNet  Google Scholar 

  15. Kollmitzer, C., Schauer, S., Rass, S., Rainer, B.: Quantum Random Number Generation. Theory and Practice. Springer, Berlin (2020)

    Book  Google Scholar 

  16. Herrero-Collantes, M., Garcia-Escartin, J.C.: Quantum random number generators. Rev. Modern Phys. 89, 015004 (2016)

    Article  ADS  MathSciNet  Google Scholar 

  17. Metropolis, N., Ulam, S.: The Monte Carlo method. J. Am. Stat. Assoc. 44, 335 (1949)

    Article  Google Scholar 

  18. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.M., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087 (1953)

    Article  ADS  Google Scholar 

  19. Gentle, J.E.: Random Number Generation and Monte Carlo Methods. Springer, Berlin (1998)

    Book  Google Scholar 

  20. Rice, J.A.: Mathematical Statistics and Data Analysis, 2nd edn. Duxbury Press, Belmont (1995)

    Google Scholar 

  21. Chung, K.L.: Elementary Probability Theory with Stochastic Processes. Springer, New York (1979)

    Book  Google Scholar 

  22. Pitman, J.: Probability. Springer, New York (1993)

    Book  Google Scholar 

  23. Maclaren, N.: Cryptographic Pseudo-random Numbers in Simulation. Cambridge Security Workshop on Fast Software Encryption. R. Anderson, Cambridge (1993)

    Google Scholar 

  24. Knuth, D.E.: The Art of Computer Programming. Vol 2: Seminumerical Algorithms. 3rd ed. Addison-Wesley, Reading (1998)

  25. Wolfram. RandomChoice, 2014. http://reference.wolfram.com/language/ref/RandomChoice.html. Accessed on January 5 2021

  26. David, F.N., Barton, D.E.: Combinatorial Chance. Hafner Publishing Co., New York (1962)

    Book  Google Scholar 

  27. Zubarew, D.N.: Nonequilibrium Statistical Thermodynamics. MIR Publishers, Moscow (1973)

  28. Pincus, S., Singer, B.H.: Randomness and degrees of irregularity. Proc. Natl. Acad. Sci. U.S.A. 93, 2083–2088 (1996)

    Article  ADS  MathSciNet  Google Scholar 

  29. Fischer, V.: A Closer Look at Security in Random Number Generators Design, pages 167–182. Springer Berlin Heidelberg, Berlin, Heidelberg (2012)

  30. Arute, F., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574, 505 (2019)

    Article  ADS  Google Scholar 

  31. D-Wave Systems Inc. D-Wave Quantum Computing, 2014. https://www.dwavesys.com/quantum-computing. Accessed on: January 5 2021

  32. Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)

    Google Scholar 

  33. von Neumann, J.: Mathematical Foundations of Quantum Mechanics. Princeton University Press, Princeton (1955)

    Google Scholar 

  34. Żurek, W.: Environment-induced superselection rules. Phys. Rev. D 26, 1862 (1982)

    Article  ADS  MathSciNet  Google Scholar 

  35. Żurek, W.: Decoherence. Rev. Modern Phys. 75, 715 (2003)

    ADS  MathSciNet  Google Scholar 

  36. Landau, L., Lifschitz, L.: Quantum Mechanics PWN. Non-relativistic Theory. Elesiver, Amsterdam (2012)

    Google Scholar 

  37. Sudarshan, E.C.G., Misra, B.: The Zeno’s paradox in quantum theory. J. Math. Phys. 18, 75689 (1977)

    MathSciNet  Google Scholar 

  38. Jacak, J.E., Jacak, W.A., Donderowicz, W.A., Jacak, L.: Quantum random number generators with entanglement for public randomness testing. Sci. Rep. 10, 164 (2020)

    Article  ADS  Google Scholar 

  39. Wootters, W., Żurek, W.: A single quantum cannot be cloned. Nature 299, 802 (1982)

    Article  ADS  Google Scholar 

  40. Pan, J., Bouwmeester, D., Daniell, M., Weinfurter, H., Zeilinger, A.: Experimental test of quantum nonlocality in three-photon Greenberger-Horne-Zeilinger entanglement. Nature 403, 515 (2000)

    Article  ADS  Google Scholar 

  41. Bouwmeester, D., Pan, J., Daniell, M., Weinfurter, H., Zeilinger, A.: Observation of three-photon Greenberger-Horne-Zeilinger entanglement. Phys. Rev. Lett. 82, 1345 (1999)

    Article  ADS  MathSciNet  Google Scholar 

  42. Thomas, P., Ruscio, L., Morin, O., Rempe, G.: Efficient generation of entangled multiphoton graph states from a single atom. Nature 608, 677 (2022)

    Article  ADS  Google Scholar 

  43. Deng, Y., Gu, Y., Liu, H., Gong, S., Su, H., Zhang, Z., Tang, H., Jia, M., Xu, J., Chen, M., Qin, J., Peng, L., Yan, J., Hu, Y., Huang, J., Li, H., Li, Y., Chen, Y., Jiang, X., Gan, L., Yang, G., You, L., Li, L., Zhong, H., Wang, H., Liu, N., Renema, J., Lu, C., Pan, J.: Gaussian boson sampling with pseudo-photon-number-resolving detectors and quantum computational advantage. Phys. Rev. Lett. 131, 150601 (2023)

    Article  ADS  Google Scholar 

  44. Reuters. PsiQuantum targets first commercial quantum computer in under six years, [Online]. Avaliable: https://www.reuters.com/technology/psiquantum-targets-first-commercial-quantum-computer-under-six-years/. Accessed on: 2023

  45. Leinaas, J.M., Myrheim, J.: On the theory of identical particles. Nuovo Cimmento 37B, 1 (1977)

    ADS  Google Scholar 

  46. Jacak, M.M., Jóźwiak, P., Niemczuk, J., Jacak, J.E.: Quantum generators of random numbers. Sci. Rep. 11, 16108 (2021)

    Article  ADS  Google Scholar 

  47. Jacak, M., Jacak, J., Jóźwiak, P., Jóźwiak, I.: Quantum cryptography: Theoretical protocols for quantum key distribution and tests of selected commercial QKD systems in commercial fiber networks. Int. J. Quantum Inf. 14, 1630002 (2016)

    Article  Google Scholar 

  48. Pirandola, S., Andersen, U.L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., Pereira, J.L., Razavi, M., Shamsul Shaari, J., Tomamichel, M., Usenko, V.C., Vallone, G., Villoresi, P., Wallden, P.: Advances in quantum cryptography. Adv. Opt. Photon. 12, 1012 (2020)

    Article  Google Scholar 

  49. Bacco, D., Da Lio, B., Cozzolino, D., Da Ros, F., Guo, X., Ding, Y., Sasaki, Y., Aikawa, K., Miki, S., Terai, H., Yamashita, T., Neergaard-Nielsen, J.S., Galili, M., Rottwitt, K., Andersen, U.L., Morioka, T., Oxenlowe, L.K.: Boosting the secret key rate in a shared quantum and classical fibre communication system. Commun. Phys. Nature 2, 1 (2019)

    Google Scholar 

  50. Pivoluska, M., Plesch, M.: Device independent random number generation. Acta Phys. Slovaca. 64, 600–663 (2014)

    Google Scholar 

  51. Bell, J.S.: Speakable and Unspeakable in Quantum Mechanics. Cambridge University Press, Cambridge (1987)

    Google Scholar 

  52. Clauser, J.F., Horne, M.A., Shimony, A., Holt, R.A.: Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett. 23, 880 (1969)

    Article  ADS  Google Scholar 

  53. Bell, J.S.: On the Einstein Podolsky Rosen paradox. Physics 1, 195–200 (1964)

    Article  MathSciNet  Google Scholar 

  54. Yuan, X., Cao, Z., Ma, X.: Randomness requirement on the Clauser–Horne–Shimony–Holt Bell test in the multiple-run scenario. Phys. Rev. A 91, 032111 (2015)

    Article  ADS  MathSciNet  Google Scholar 

  55. Mermin, N.D.: Physics: QBism puts the scientist back into science. Nature 507, 421–423 (2014)

    Article  ADS  Google Scholar 

  56. Gerry, C., Knight, P.: Intruductory Quantum Optics. Cambridge University Press, Cambridge (2004)

    Book  Google Scholar 

  57. Doganaksoy, A., Ege, B., Mus, L.: Extended results for independence and sensitivity of nist randomness tests. ISC Turkey (2008)

  58. Sys, M., Riha, Z., Matyas, V., Marton, K., Suciu, A.: On the interpretation of results from the nist statistical test suite. Rom. J. Inf. Sci. Technol. 18, 18 (2015)

    Google Scholar 

  59. Maurer, U.M.: A universal statistical test for random bit generators. J. Cryptol. 5, 89–105 (1992)

    Article  MathSciNet  Google Scholar 

  60. Revesz, P.: Random Walk in Random and Non-Random Environments. World Scientific, Singapore (1990)

    Book  Google Scholar 

  61. Marsaglia, G.: Diehard: a battery of tests of randomness (1996). http://stat.fsu.edu/pub/diehard/. Accessed on: January 5 2021

  62. Brown, R.G.: Dieharder, 2006. https://webhome.phy.duke.edu/ rgb/General/dieharder.php. Accessed on January 5 2021

  63. Marsaglia, G., Tsay, L.H.: Matrices and the structure of random number sequences. Linear Algebra Appl. 67, 147–156 (1985)

    Article  MathSciNet  Google Scholar 

  64. Rukhin, A.: Approximate entropy for testing randomness. J. Appl. Probab. 37, 88–100 (2000)

    Article  MathSciNet  Google Scholar 

  65. Bracewell, R.N.: The Fourier Transform and Its Applications. McGraw-Hill, New York (1986)

    Google Scholar 

  66. Killman, W., Schüth, J., Thumser, W., Uludag, I.: A note concerning the dft test in nist special publication 800-22. T-Systems, Systems Integration (2004)

  67. Mermin, N.D.: Quantum mysteries revisited. Am. J. Phys. 58, 731 (1990)

    Article  ADS  MathSciNet  Google Scholar 

Download references

Acknowledgements

This study was supported by the Polish National Center for Research and Development project POIR.01.01.01-00-0173/15 Jurand.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Witold A. Jacak.

Ethics declarations

Conflict of interest

No conflict of interest is declared.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Appendix: Quantum sources of entropy other than von Neumann projection

Implementations of von Neumann projection scheme of quantum measurement, though transparent physically, are not easy to be implemented for probing and register outcomes of quantum measurements [15]. Moreover, are usually heavily biased by classical noise components. Therefore, to construct QRNGs some alternative sources of the entropy are considered. A wide class of other than a direct measurement quantum effects attributed to quantum randomness is related to probabilistic interpretation of wave functions and quantum transitions. A wave function provides only statistical information on the behavior of a system, which can be observed classically. For example, the probing of the quantum particle position will give a random sequence according to the probability defined by the modulus square of the wave function of this particle, which, in the position representation, describes random quantum localization of a particle. The same holds for the decomposition of the wave function in the basis of some orthonormal states, which span a Hilbert space and can be used to a change of a representation. Coefficients (\(c_i\) complex, in general) of this decomposition (\(\Psi =\sum _ic_i\Phi _i\)) define only probability (\(\vert c_i\vert ^2\), \(\sum _i \vert c_i\vert ^2=1\)) for projection onto the corresponding i-th state from the basis of eigen-functions (or, more generally, eigen-subspaces) of the Hermitian operator corresponding to the measured variable. However, it arises here a question, which probability type occurs here – frequentional or conditional ones. The former assumes infinite, in principle, repeating the measurement of the quantum state, which is, however, impossible, because each quantum measurement is demolishing and the original quantum state disappears at the measurement and cannot be repeatably measured. The solution would be cloning of an initial quantum state, but according to the non-cloning theorem by Wootters and Żurek, any unknown quantum state cannot be cloned [39]. The exception of this rule is only for known states—these states should be considered as states of the known fixed basis. Taking an arbitrary set of qubits and measuring each in a known basis, statistically half of qubits will be projected onto the same known state (one of two possible in the measurement). In the case when the known states were stationary states, by the application of some external field (e.g., of a magnetic field for spin-like qubits), one can select qubits (particles) in the same known state, via separation in energy (e.g., due to Zeeman splitting for spin qubits).

The alternative notion for probability is the conditional probability, which seems even more natural in quantum mechanical terms. Employing properties of Bayesian conditional probability to quantum mechanics changes its foundations and the related quantum mechanics interpretation is called as QBism [55]. The consequences for formal quantum information processing are, however, not explored upon this approach.

In the case of a system which is affected by time-dependent perturbation, the system response can be accounted for in terms of the probability of induced by the perturbation transitions between original stationary states of the systems. This probability is again of the unconditional quantum type, as it corresponds to the decomposition of the non-stationary state of the system with inclusion of time-dependent perturbation in the basis of original stationary states. The time-dependent coefficients of this decomposition define the probability amplitudes for the induced quantum transitions. The modulus square of these coefficients are truly random numbers and can be easily estimated in linear approximation with respect to the perturbation strength. The resulting Fermi golden rule for these transitions probability is directly applicable to a wide class of physical observable phenomena in micro-systems and their characteristics possible to be measured in a classical manner. The latter property is related to a step toward a classical behavior assuming quantum transitions in the continuous spectrum of stationary states (similar to classical distribution of energy). To be more specific, the transition probability between n-th and m-th stationary states of the system upon the perturbation \({\hat{V}}\) switched on at \(t=0\) is given for the passage of time T by the formula,

$$\begin{aligned} w_{n,m}=\vert \langle n\vert {\hat{V}}\vert m\rangle \vert ^2 \frac{sin^2(\omega _{n.m}T/2)}{(\hbar \omega _{n.m}/2)^2}, \end{aligned}$$
(26)

where \(\omega _{n,m}=\frac{E_n-E_m}{\hbar }\). In the limit \(T\rightarrow \infty \) the above equation attains a form of Fermi golden rule (assuming that the perturbation field \({\hat{V}}\) periodically varies in time with the frequency \(\omega \)),

$$\begin{aligned} w_{n,m}/T=\frac{2\pi }{\hbar }\vert \langle n\vert {\hat{V}}\vert m\rangle \vert ^2\delta (E_n-E_m\pm \hbar \omega ), \end{aligned}$$
(27)

Dirac delta has arisen from the limiting property of sinc function (\(lim_{x\rightarrow \infty }\frac{sin^2(ax/2)}{(a/2)^2x}=2\pi \delta (a)\)), \(\pm \omega \) corresponds to the emission or absorption of perturbation field quantum, respectively. Probability must be limited by 1; thus, the Dirac delta has to be quenched upon some integral—alternatively, upon an integral with respect to a continuous spectrum of final states m, or initial states n, or with respect to a Fourier variable related to the spectral picture of a non-monochromatic perturbation. The probability \(w_{n,m}\) after integration removing the Dirac delta meets with macroscopic properties of quantum systems manifesting themselves at, e.g., a conductivity or other transport phenomena, at optical transitions (absorption and emission of light), at nuclear transitions and others—in fact, at all macroscopically noticeable properties of quantum systems. The probability expressed by Fermi golden rule still possesses, however, an absolute random quantum character hidden in tiny fluctuations of quantum system response according to this rule.

Registering of these fluctuations is a central problem for practical realizations of QRNGs, easiest to be probed for a very weak perturbations, like at tunneling currents across p-n semiconductor junctions in diodes or transistors or for extremely weak light emission of photo-diodes. In the latter case, this emission is frequently referred to single photon emission, which is, however, only popular terminology, because for really fainting light signals, energy emitted per some period of time is often only a fraction of a single photon energy \(\hbar \omega \). The popular view on the quantum character of light is originated in quantum optics based on the quantization of classical e-m field in some volume being the collection of non-interacting oscillators with frequencies of e-m field Fourier spectrum. The planar wave components of the Fourier series for the vector potential of the e-m field serve as annihilation and creation operators of introduced in this way ’photons’, and the whole spirit of quantum optics is related to the non-commutation of the operator of photon numbers with the quantized in the same manner electric and magnetic fields. This non-commutation is caused by the quantum oscillator properties including its zero oscillations, and it leads to a quantum uncertainty principle of the photon number and the field phase [56]. Probabilistic character of optical transitions used for QRNGs is not related thus with single photons, but rather with the quantum randomness expressed by the Fermi golden rule for quantum transitions in some other system interacting with light.

The same holds for key distribution (QKD) systems in quantum cryptography utilizing photons as flying qubits [3], where through the dark quantum channel are not pushing single photons but rather weak e-m waves with the phase randomly assigned (in a macroscopic way) according to a true random sequence of bits produced by a QRNG. This enhances the significance of QRNGs because QKD over large distances is most prospective for such continuous variable randomly selected for flying qubits, being in fact imprinted in a classical e-m wave according to QRNG bit sequence (both for dark channels in optical fibers or in open air of space, the latter for quantum cryptographic communication between e.g., satellites).

Classical methods for testing of randomness

There are many statistical tests being utilized to testing of randomness of bit sequences. To most popular belong,

  • NIST test [10, 57, 58]—developed by The National Institute of Standards and Technology of the United States at 2010. The NIST kit includes: test for the frequency of single bits 0 and 1 occurrences in the studied sequence, test for the frequency of single 0 and 1 occurrences in the block of the studied sequence, mileage test, test of the longest run in the block of the studied sequence, binary matrix order test—test of linear relationships between subsequences of the same length of the tested sequence, spectral test—discrete Fourier transform test, test for occurrence of non-overlapping patterns, test for overlapping patterns, universal statistical Maurer test [59], linear complexity test, serial test - pattern distribution test, entropy estimation test, cumulative sum test, random trip test and variant random trip test [60]. The NIST test partially overlaps with the Diehard (Dieharder) tests listed below. The NIST test, similarly to other statistical tests, is effective in the assessment of randomness of digital sequences produced by classical pseudo-random generators or QRBGs, but is unable to confirm absolute quantum randomness.

  • Diehard and Dieharder tests [61,62,63]—is a set of randomness tests created by the American mathematician and computer scientist George Marsaglia in 1964 and revised in 2006 by Robert G. Brown, who named the modified Dieharder kit. The related kit embraces: birthday spacing test - a statistical test of the number of duplicate intervals between successive properly defined birthdays, overlapping permutation test, binary order test for matrices, search for missing 20 letter (letters 0 and 1) words in overlapping 20 letter words, into which the analyzed sequence is divided, test for the rare occurrence of overlapping short sequences, DNA - a test based on two-bit sequences encoding the letters C, G, A, T forming 10 letter words, test to count ones in the byte stream, parking lot test, minimum distance test, squeeze test, overlapping sums test, runs test, craps test. Similarly to NIST, the Diehard/Dieharder test is unable to confirm the absolute quantum randomness.

  • Test U01—is a C language library for empirical testing of random number generators created by a team at the University of Montreal in 2007. The kit includes: tests of the distribution of t-dimensional vectors in a unit hypercube, tests based on discrete and continuous empirical entropies [64], test of the distance between the nearest points in a sample on a unit torus in t-dimensional space, Knuth tests in the book [24], Diehard/Dieharder tests, test of discrete random walks, compressibility test, tests using spectral methods (mainly discrete Fourier transform [65, 66]). This test is also effective in assessment of the randomness quality, but is unable to distinguish a true quantum randomness.

Fig. 5
figure 5

Generator Quantis by the Swiss company IDQuantique [ idquantique.com]

Examples of QRNGs in the market

There are many QRNGs commercially proposed in the market, below some of them are listed and compared.

  • IDQ Quantis Random Number Generator – generator by the Swiss company idQuantique, which is a pioneer in the commercialization of quantum cryptography (Clavis series) and quantum random generators (Quantis). The company was founded as a spin-off of the University of Geneva. The QRNGs were initially components of the cryptographic Clavis quantum key distribution sets, only after some time they were introduced to the offer as separate devices. Speed: PCIe 4/16 Mb/s, USB 4 Mb/s, size more than 10 cm (cf. Fig. 5), source of randomness: the light source illuminates the semi-transmissive mirror and hits the two detectors.

  • ComScire PureQuantum—generator of the American company ComScire specializing in creating generators based on physical phenomena. The company was established for this purpose in 1994. Speed: USB 4/32/128 Mb/s Entropy source: current noise associated with leakage of carriers due to tunneling in MOS transistor, size > 10 cm.

  • Toshiba UFICS-QRNG—generator of the Japanese Toshiba Corporation, ultra-fast, speed 8 Gb/s, entropy source: phase noise from spontaneous emission from a pulsed laser, size ca. 20 cm.

  • PicoQuant PQRNG 150—generator by the German company PicoQuant, founded in 1996, specializing in the production of optical and electronic devices and components. Its offer includes a generator that uses a high-speed quantum process. The manufacturer does not publish the detailed parameters of the device. Speed: 150 Mbps USB, entropy source: generation process based on photon arrival times, size—macroscopic.

  • Whitewood Entropy Engine—generator from the American company Whitewood, established to commercialize its own quantum random number generator for cryptographic applications. Speed: 350 Mbps PCI Express, entropy source: lensing a photon beam onto the detector, size—macroscopic.

  • QuintessenceLabs qStream—generator of the Australian company QuintessenceLabs established as a spin-off of the Australian National University. The company offers comprehensive solutions in the field of modern cryptography, including quantum cryptography. The proposed solutions, both the quantum key distribution (QKD) and QRNG systems, are characterized by very high speed parameters (related to the physical model used, which, however, on the other hand, may be questioned as not fully quantum). Speed: 1 Gbits/s RJ-45 Entropy source: dividing a multi-photon laser beam into two and “subtracting” them from each other, size—macroscopic.

  • QuantumNumbersCorp QNG2—generator by the Canadian company Quantum Numbers Corporation (QNC) established for the commercialization of security systems based on QRNG. The company’s activities are aimed at creating microprocessor solutions for the broad financial, banking, military, mobile devices and telecommunications markets. They propose the first QRNG in the form of a chip on the commercial market. Speed: 1 Gbits/s, entropy source: quantum tunneling, size—miniaturized to a micro-chip (not fully quantum—electron transport may have a significant classical component).

  • EYL Micro Quantum Random Number Generator—product of the South Korean company EYL (Everywhere in Your Life, founded in 2015), which promotes its technology based on the decay of radioactive isotopes, miniaturized to the size of a chip (sub-centimeter size). The company was awarded the title of the most promising startup in 2016 in the international competition in Boston, USA. The offer is focused on the integration of QRNG with all possible IT-based solutions, in particular with intelligent factories, smart homes or intelligent mobility (e.g., intelligent cars). Speed: 40 Gb/s, entropy source: decay of radioactive isotopes (probability of classical noise contribution).

  • qutools quRN—generator of the German company qutools, which is a spin-off of the University in Munich from 2005. The company specializes in the production and distribution of quantum computing devices, including sources of entangled photons, QRNGs, quantum cryptography systems and optics in the quantum regime. Speed: 50 Mb/s USB, entropy source: uncertainty of detection times with single-photon detectors of photons emitted from the LED, size—macroscopic.

  • Micro Photon Devices Quantum Random Number Generator – product of the Italian company Micro Photon Devices, which is a spin-off of the Polytechnic University of Milan, founded in 2004. The company manufactures specialized optical equipment in the quantum regime (e.g., single-photon SPAD detectors), including QRNG based on the phenomena of quantum optics. Speed: 128 Mb/s USB, entropy source: internal characteristics of the illuminated quantum detector in the form of an avalanche diode, size—macroscopic.

  • QuantumCTek Quantum Random Number Generator QRNG100E – generator of the Chinese company QuantumCTek Co., Ltd., a Chinese pioneer and leader in commercialized quantum information technology. The product is claimed to be one of the fastest commercial QRNG. Speed: 600 Mb/s USB, entropy source: based on the phase noise of laser spontaneous emission (size—macroscopic, probable classical noise component).

  • uside FMC 400 – generator of the Spanish company Quside, which is a spin-off of The Institute of Photonic Sciences (ICFO) in Barcelona, founded in 2017. In 2020 the company launched its first QRNG Quside FMC 400, based on Quside’s proprietary phase-diffusion quantum random number generation technology. Speed: 400 Mb/s USB, entropy source: phase-diffusion process for light emitter due to spontaneous emission events (size—macroscopic, probable classical noise component) [40,41,42,43, 67].

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jóźwiak, P., Jacak, J.E. & Jacak, W.A. New concepts and construction of quantum random number generators. Quantum Inf Process 23, 132 (2024). https://doi.org/10.1007/s11128-024-04335-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11128-024-04335-8

Keywords

Navigation