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:1411.4512 · Physical Review Applied

Maximization of Extractable Randomness in a Quantum Random-Number Generator

Jing Yan Haw, Syed M. Assad, Andrew M. Lance, N. H. Y. Ng, V. Sharma, Ping Koy Lam, Thomas Symul

Published May 11, 2015• 138 citations
arXivHTMLPDF

Abstract

Quantum random-number generators (QRNGs) play a decisive role in protocols for encrypted communication. Unfortunately, classical noise often spoils both the integrity and speed of such quantum devices. The authors demonstrate a new framework to harness maximum randomness without compromising security, and which allows for more cost-effective and smaller units. This work paves the way toward a reliable, high-bit-rate, and environmentally immune QRNG for information-security applications.

DOI
10.1103/physrevapplied.3.054004

Related papers

A Novel Hybrid Method for Randomness Extraction

Maksim Iavich, Роман Сергійович Одарченко

Randomness is widely used in various fields, including encryption, statistical analysis, and numerical simulations. Randomness is also a fundamental resource in science and engineering. For such applications, we usually need to provide unbiased and independent random bits. This raises the issue of where to get these supposed random bits. Quantum random number generators (QRNGs) generate real random numbers based on the inherent randomness of quantum measurements. In practice, unfortunately, quantum randomness is inevitably mixed with classical randomness due to classical noise. Also, randomness is often correlated and biased. It is necessary to process the resulting raw bits sequence and convert them to good-quality output values that are as close to uniform distribution as possible. Random extractors are required for this. We analyze the randomness obtained by quantum random number generators as well as various examples of post-processing. We discuss the types of randomness extractors. Also, we use information-theoretically secure extractors and present improved novel randomness extraction.

CRC Press eBooks•May 30, 2025•0 citations

Extracting More Quantum Randomness With Non-Uniform Quantization

Bai-Xiang Ji, Jian Li, Qin Wang

Random numbers generated via quantum process is indeterministic, which are of essential to the cryptographic communication and the large-scale computer modeling. However, in realistic scenarios, classical noises can inevitably contaminate the raw sequences of a quantum randomness number generator (QRNG), and then compromise the security of the QRNG. Min-entropy is a useful approach that can quantify the randomness independent of side-information. To enhance the extractable randomness of the raw sequences arising from the QRNG, we propose a new method which exploits non-uniform quantization methods instead of uniform sampling methods and effectively enhances the extractable randomness from the QRNG at a high quantum-to-classical-noise ratio (QCNR). Given a QCNR as 50 dB and a 16-bit analog-to-digital converter (ADC), the worst-case conditional min-entropy of the non-uniform quantization scheme is improved by nearly 11% compared with that of the uniform sampling scheme.

IEEE photonics journal•Aug 1, 2022•2 citations

Construction of a Quantum Random Number Generator

Kashish Karera, Ayan Khan, Humanyou Tariq +4 more

Quantum random number generators (QRNG) are the prime source of randomness, by exploiting the unpredictable nature of Quantum mechanics QRNG aims to provide a string of completely random utterly unpredictable numbers. QRNGs are crucial for cryptography, scientific calculation, simulation, and many more real-world applications. Our Optical Quantum Random Number Generator (OQRNG) utilizes a high-speed pulsating laser, a Polarizing beam splitter (PBS), photodetectors, and advanced signal processing units that capture and digitize random photon intensity forming the raw random bit stream. This technique is famously known as Branching Path Technique. After that, we implement rigorous testing that encompasses the statistical randomness tests developed by National Institute of Standards and Technology (NIST) to ensure the guaranteed ran-domness meets security standards. A user-friendly Graphic user interface (GUI) simplifies interaction with the QRNG allowing the user to configure device settings, monitor system performance, and securely extract random numbers. Our findings help us demonstrate the superiority of QRNGs over classical random number generators, and highlight the potential of photon-based QRNGs and their environmentally friendly and efficient random number generation.

International Conference on Innovations in Computer Science & Software Engineering (ICONICS)•Nov 13, 2024•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

Enhancing Quantum Random Number Generators, Cryptographic Security, and Machine Learning-Based Cryptoanalysis

U. Jayalatsumi, T. Godhavari, Borra Keerthana +2 more

Randomness is essential in cryptography for key generation and secure information exchange, ensuring confidentiality and protection. Quantum Random Number Generators (QRNGs) leverage quantum mechanics to produce truly random numbers, offering a major advantage over Pseudo Random Number Generators (PRNGs), which are slower and less secure due to their deterministic nature. Quantum computing boosts QRNG efficiency, making them ideal for cryptographic applications, such as secure key exchange and encrypted communication. QRNGs generate stronger encryption systems by utilizing quantum phenomena like Bloch sphere rotations. The integration of machine learning (ML) with QRNGs further enhances their effectiveness, optimizing random sequences for improved speed and security. This combination of QRNGs and ML provides a powerful approach to cryptography, ensuring more secure communication channels and better protection against potential attacks.

Advances in computational intelligence and robotics book series•Jun 11, 2025•1 citation

Security analysis and improvement of source independent quantum random number generators with imperfect devices

Xing Ping Lin, Shuang Wang, Zhen-Qiang Yin +7 more

Abstract A quantum random number generator (QRNG) as a genuine source of randomness is essential in many applications, such as number simulation and cryptography. Recently, a source-independent quantum random number generator (SI-QRNG), which can generate secure random numbers with untrusted sources, has been realized. However, the measurement loopholes of the trusted but imperfect devices used in SI-QRNGs have not yet been fully explored, which will cause security problems, especially in high-speed systems. Here, we point out and evaluate the security loopholes of practical imperfect measurement devices in SI-QRNGs. We also provide corresponding countermeasures to prevent these information leakages by recalculating the conditional minimum entropy and adding a monitor. Furthermore, by taking into account the finite-size effect, we show that the influence of the afterpulse can exceed that of the finite-size effect with the large number of sampled rounds. Our protocol is simple and effective, and it promotes the security of SI-QRNG in practice as well as the compatibility with high-speed measurement devices, thus paving the way for constructing ultrafast and security-certified commercial SI-QRNG systems.

arXiv:2101.04327•npj Quantum Information•Dec 10, 2020•23 citations
Quantum random-number generators (QRNGs) play a decisive role in protocols for encrypted communication. Unfortunately, classical noise often spoils both the integrity and speed of such quantum devices. The authors demonstrate a new framework to harness maximum randomness without compromising security, and which allows for more cost-effective and smaller units. This work paves the way toward a reliable, high-bit-rate, and environmentally immune QRNG for information-security applications.
Randomness is widely used in various fields, including encryption, statistical analysis, and numerical simulations. Randomness is also a fundamental resource in science and engineering. For such applications, we usually need to provide unbiased and independent random bits. This raises the issue of where to get these supposed random bits. Quantum random number generators (QRNGs) generate real random numbers based on the inherent randomness of quantum measurements. In practice, unfortunately, quantum randomness is inevitably mixed with classical randomness due to classical noise. Also, randomness is often correlated and biased. It is necessary to process the resulting raw bits sequence and convert them to good-quality output values that are as close to uniform distribution as possible. Random extractors are required for this. We analyze the randomness obtained by quantum random number generators as well as various examples of post-processing. We discuss the types of randomness extractors. Also, we use information-theoretically secure extractors and present improved novel randomness extraction.
Random numbers generated via quantum process is indeterministic, which are of essential to the cryptographic communication and the large-scale computer modeling. However, in realistic scenarios, classical noises can inevitably contaminate the raw sequences of a quantum randomness number generator (QRNG), and then compromise the security of the QRNG. Min-entropy is a useful approach that can quantify the randomness independent of side-information. To enhance the extractable randomness of the raw sequences arising from the QRNG, we propose a new method which exploits non-uniform quantization methods instead of uniform sampling methods and effectively enhances the extractable randomness from the QRNG at a high quantum-to-classical-noise ratio (QCNR). Given a QCNR as 50 dB and a 16-bit analog-to-digital converter (ADC), the worst-case conditional min-entropy of the non-uniform quantization scheme is improved by nearly 11% compared with that of the uniform sampling scheme.
Quantum random number generators (QRNG) are the prime source of randomness, by exploiting the unpredictable nature of Quantum mechanics QRNG aims to provide a string of completely random utterly unpredictable numbers. QRNGs are crucial for cryptography, scientific calculation, simulation, and many more real-world applications. Our Optical Quantum Random Number Generator (OQRNG) utilizes a high-speed pulsating laser, a Polarizing beam splitter (PBS), photodetectors, and advanced signal processing units that capture and digitize random photon intensity forming the raw random bit stream. This technique is famously known as Branching Path Technique. After that, we implement rigorous testing that encompasses the statistical randomness tests developed by National Institute of Standards and Technology (NIST) to ensure the guaranteed ran-domness meets security standards. A user-friendly Graphic user interface (GUI) simplifies interaction with the QRNG allowing the user to configure device settings, monitor system performance, and securely extract random numbers. Our findings help us demonstrate the superiority of QRNGs over classical random number generators, and highlight the potential of photon-based QRNGs and their environmentally friendly and efficient random number generation.
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.
Randomness is essential in cryptography for key generation and secure information exchange, ensuring confidentiality and protection. Quantum Random Number Generators (QRNGs) leverage quantum mechanics to produce truly random numbers, offering a major advantage over Pseudo Random Number Generators (PRNGs), which are slower and less secure due to their deterministic nature. Quantum computing boosts QRNG efficiency, making them ideal for cryptographic applications, such as secure key exchange and encrypted communication. QRNGs generate stronger encryption systems by utilizing quantum phenomena like Bloch sphere rotations. The integration of machine learning (ML) with QRNGs further enhances their effectiveness, optimizing random sequences for improved speed and security. This combination of QRNGs and ML provides a powerful approach to cryptography, ensuring more secure communication channels and better protection against potential attacks.
Abstract A quantum random number generator (QRNG) as a genuine source of randomness is essential in many applications, such as number simulation and cryptography. Recently, a source-independent quantum random number generator (SI-QRNG), which can generate secure random numbers with untrusted sources, has been realized. However, the measurement loopholes of the trusted but imperfect devices used in SI-QRNGs have not yet been fully explored, which will cause security problems, especially in high-speed systems. Here, we point out and evaluate the security loopholes of practical imperfect measurement devices in SI-QRNGs. We also provide corresponding countermeasures to prevent these information leakages by recalculating the conditional minimum entropy and adding a monitor. Furthermore, by taking into account the finite-size effect, we show that the influence of the afterpulse can exceed that of the finite-size effect with the large number of sampled rounds. Our protocol is simple and effective, and it promotes the security of SI-QRNG in practice as well as the compatibility with high-speed measurement devices, thus paving the way for constructing ultrafast and security-certified commercial SI-QRNG systems.