Quantum generators of random numbers

Abstract Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness...

Full description

Bibliographic Details
Main Authors: Marcin M. Jacak, Piotr Jóźwiak, Jakub Niemczuk, Janusz E. Jacak
Format: Article
Language:English
Published: Nature Publishing Group 2021-08-01
Series:Scientific Reports
Online Access:https://doi.org/10.1038/s41598-021-95388-7
id doaj-9d1ebf45f5dc4749b3837a8d635cb74b
record_format Article
spelling doaj-9d1ebf45f5dc4749b3837a8d635cb74b2021-08-15T11:23:47ZengNature Publishing GroupScientific Reports2045-23222021-08-0111112110.1038/s41598-021-95388-7Quantum generators of random numbersMarcin M. Jacak0Piotr Jóźwiak1Jakub Niemczuk2Janusz E. Jacak3Wrocław University of Science and TechnologyFaculty of Computer Science, Wrocław University of Science and TechnologyWrocław University of Science and TechnologyDepartment of Quantum Technologies, Wrocław University of Science and TechnologyAbstract Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.https://doi.org/10.1038/s41598-021-95388-7
collection DOAJ
language English
format Article
sources DOAJ
author Marcin M. Jacak
Piotr Jóźwiak
Jakub Niemczuk
Janusz E. Jacak
spellingShingle Marcin M. Jacak
Piotr Jóźwiak
Jakub Niemczuk
Janusz E. Jacak
Quantum generators of random numbers
Scientific Reports
author_facet Marcin M. Jacak
Piotr Jóźwiak
Jakub Niemczuk
Janusz E. Jacak
author_sort Marcin M. Jacak
title Quantum generators of random numbers
title_short Quantum generators of random numbers
title_full Quantum generators of random numbers
title_fullStr Quantum generators of random numbers
title_full_unstemmed Quantum generators of random numbers
title_sort quantum generators of random numbers
publisher Nature Publishing Group
series Scientific Reports
issn 2045-2322
publishDate 2021-08-01
description Abstract Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.
url https://doi.org/10.1038/s41598-021-95388-7
work_keys_str_mv AT marcinmjacak quantumgeneratorsofrandomnumbers
AT piotrjozwiak quantumgeneratorsofrandomnumbers
AT jakubniemczuk quantumgeneratorsofrandomnumbers
AT januszejacak quantumgeneratorsofrandomnumbers
_version_ 1724162982737346560