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

Scientific Reports

Quantum random number generators with entanglement for public randomness testing

Janusz Edward Jacak, Witold Aleksander Jacak, Wojciech A. Donderowicz, Lucjan Jacak

Published Jan 13, 2020• 31 citations
Publisher

Abstract

We discuss a simple idealistic quantum entanglement based protocol for quantum random number generation allowing a trusted third party to publicly perform arbitrarily complex tests of randomness without any violation of the secrecy of the generated bit sequences. The protocol diminishes also an average time of the randomness testing (thus enabling arbitrary shortening of this time with increasing number of entangled qubits).

DOI
10.1038/s41598-019-56706-2

Related papers

A privacy-preserving publicly verifiable quantum random number generator

Tanvirul Islam, Anindya Banerji, Chin Jia Boon +5 more

Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also random number-based applications where an honest user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. Here, we report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.

Scientific Reports•May 17, 2024•2 citations

A privacy-preserving publicly verifiable quantum random number generator

Tanvirul Islam, Anindya Banerji, Chin Jia Boon +5 more

Abstract Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also random number-based applications where the user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. Here, we report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.

•Dec 28, 2023•0 citations

A privacy-preserving publicly verifiable quantum random number generator

Tanvirul Islam, Banerji, Anindya, Chin Jia Boon +5 more

Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also applications where the user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. We report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.

arXiv:2305.10909•May 18, 2023•0 citations

Quantum generators of random numbers

Marcin M. Jacak, Piotr Paweł Jóźwiak, Jakub Niemczuk +1 more

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.

Scientific Reports•Aug 9, 2021•85 citations

Modulator-free, self-testing quantum random number generator

Ana Blázquez, Fadri Grünenfelder, Anthony Martin +3 more

Quantum random number generators (QRNGs) use the inherent unpredictability of quantum mechanics to generate true randomness, as opposed to classical random number generators. However, ensuring the authenticity of this randomness still requires robust verification. Self-testing QRNGs address this need by enabling the validation of the randomness produced based on the observed data from the experiment while requiring few assumptions. In this work, we present a practical, self-testing QRNG designed to operate with an untrusted measurement device and a partially characterized source, allowing the user to check the adequate functioning of the setup in real time. Our experiment yields a rate of certified random bits of 450 kbps.

arXiv:2507.12346•EPJ Quantum Technology•Mar 24, 2026•0 citations

Megahertz-Rate Semi-Device-Independent Quantum Random Number Generators Based on Unambiguous State Discrimination

Jonatan Bohr Brask, Anthony Martin, William Esposito +4 more

Generating certifiably random bit sequences using quantum devices is a fundamental challenge for cryptography, particularly as applied to secure communication. The device-independent approach offers the best security, but is impractical. This study presents a quantum random-number generator (QRNG) that is simple and achieves high bit rates, yet requires only mild assumptions (almost no trust) regarding the setup. This protocol offers a promising solution for the next generation of QRNGs, combining ease of implementation, commercially viable rates, and strong security.

arXiv:1612.06566•Physical Review Applied•May 25, 2017•125 citations
We discuss a simple idealistic quantum entanglement based protocol for quantum random number generation allowing a trusted third party to publicly perform arbitrarily complex tests of randomness without any violation of the secrecy of the generated bit sequences. The protocol diminishes also an average time of the randomness testing (thus enabling arbitrary shortening of this time with increasing number of entangled qubits).
Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also random number-based applications where an honest user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. Here, we report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.
Abstract Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also random number-based applications where the user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. Here, we report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.
Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also applications where the user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. We report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.
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.
Quantum random number generators (QRNGs) use the inherent unpredictability of quantum mechanics to generate true randomness, as opposed to classical random number generators. However, ensuring the authenticity of this randomness still requires robust verification. Self-testing QRNGs address this need by enabling the validation of the randomness produced based on the observed data from the experiment while requiring few assumptions. In this work, we present a practical, self-testing QRNG designed to operate with an untrusted measurement device and a partially characterized source, allowing the user to check the adequate functioning of the setup in real time. Our experiment yields a rate of certified random bits of 450 kbps.
Generating certifiably random bit sequences using quantum devices is a fundamental challenge for cryptography, particularly as applied to secure communication. The device-independent approach offers the best security, but is impractical. This study presents a quantum random-number generator (QRNG) that is simple and achieves high bit rates, yet requires only mild assumptions (almost no trust) regarding the setup. This protocol offers a promising solution for the next generation of QRNGs, combining ease of implementation, commercially viable rates, and strong security.