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

Quantum Information Processing

Applications of disentropy in the analysis of randomness generated by quantum random number generators

Santos Oliveira, J. S. de Andrade, G. L. de Oliveira, Rubens Viana Ramos

Published Feb 28, 2025• 2 citations
Publisher
DOI
10.1007/s11128-025-04694-w

Related papers

A Post-Processing Method for Quantum Random Number Generator Based on Zero-Phase Component Analysis Whitening

Longju Liu, Jie Yang, Mei Wu +4 more

Quantum Random Number Generators (QRNGs) have been theoretically proven to be able to generate completely unpredictable random sequences, and have important applications in many fields. However, the practical implementation of QRNG is always susceptible to the unwanted classical noise or device imperfections, which inevitably diminishes the quality of the generated random bits. It is necessary to perform the post-processing to extract the true quantum randomness contained in raw data generated by the entropy source of QRNG. In this work, a novel post-processing method for QRNG based on Zero-phase Component Analysis (ZCA) whitening is proposed and experimentally verified through both time and spectral domain analysis, which can effectively reduce auto-correlations and flatten the spectrum of the raw data, and enhance the random number generation rate of QRNG. Furthermore, the randomness extraction is performed after ZCA whitening, after which the final random bits can pass the NIST test.

Entropy•Jan 14, 2025•7 citations

Study of quantum random number generators

Patrik Mäki

•May 15, 2021•0 citations

New concepts and construction of quantum random number generators

Piotr Paweł Jóźwiak, Janusz Edward Jacak, Witold Aleksander Jacak

Quantum Information Processing•Mar 28, 2024•10 citations

Evaluating Quantum Randomness: Random-Walk-Based Characterization of Quantum-Random Number Generators

Luis Gustavo Maciel Riveros, Marvyn Inga, João Batista Rosolem +3 more

This work presents a comparative study of pseudo-random (PRNG) and quantum-random (QRNG) number generators based on a combination of random-walk-based variance analysis and uniformity assessment. The analysis shows that the quantum source presents the expected variability patterns and exhibits closer agreement with an ideal uniform distribution, while pseudo-random shows wider dispersion and bias. These findings indicate that QRNG presents better performance for applications that require the highest levels of randomness integrity.

SBFoton International Optics and Photonics Conference (SBFoton IOPC)•Sep 21, 2025•0 citations

A Comparative Study and Analysis of Quantum Random Number Generator with True Random Number Generator

Shashi Kant Pandey, R. Jenef

Random numbers play a central role in cryptography, cyber security, and gaming applications. Extracting bits from some random natural activity is one of the primitive ways to generate random numbers. True random number generator(TRNG) and quantum random number generator(QRNG) are examples of this random number sequence. The development of quantum technology made it possible to extract random sequences from quantum entropy sources. This sequence is called quantum random numbers and the whole setup is named a quantum random number generator. A suitable sampling and a physical device for the entropy source are the building blocks for a TRNG. Here we present a comparative analysis of two random number generators. Apart from the conventional statistical test for randomness, here we introduce a straightforward coefficient based on the concept of non-linearity of the Boolean function to determine the availability of any linearity in a chosen random binary sequence. It reveals the cryptographic suitability of the generated sequence w.r.t any correlation attack. A comparison of the nonlinearity of two Boolean sequences generated from two different random sources is presented.

International Conference on Communication Systems & Networks (COMSNETS)•Jan 3, 2024•14 citations

Theoretical and Empirical Testing of the Randomness of a Quantum Random Number Generator with Quantum Entanglement

Piotr Paweł Jóźwiak

Communications in computer and information science•Jan 1, 2023•2 citations
Quantum Random Number Generators (QRNGs) have been theoretically proven to be able to generate completely unpredictable random sequences, and have important applications in many fields. However, the practical implementation of QRNG is always susceptible to the unwanted classical noise or device imperfections, which inevitably diminishes the quality of the generated random bits. It is necessary to perform the post-processing to extract the true quantum randomness contained in raw data generated by the entropy source of QRNG. In this work, a novel post-processing method for QRNG based on Zero-phase Component Analysis (ZCA) whitening is proposed and experimentally verified through both time and spectral domain analysis, which can effectively reduce auto-correlations and flatten the spectrum of the raw data, and enhance the random number generation rate of QRNG. Furthermore, the randomness extraction is performed after ZCA whitening, after which the final random bits can pass the NIST test.
This work presents a comparative study of pseudo-random (PRNG) and quantum-random (QRNG) number generators based on a combination of random-walk-based variance analysis and uniformity assessment. The analysis shows that the quantum source presents the expected variability patterns and exhibits closer agreement with an ideal uniform distribution, while pseudo-random shows wider dispersion and bias. These findings indicate that QRNG presents better performance for applications that require the highest levels of randomness integrity.
Random numbers play a central role in cryptography, cyber security, and gaming applications. Extracting bits from some random natural activity is one of the primitive ways to generate random numbers. True random number generator(TRNG) and quantum random number generator(QRNG) are examples of this random number sequence. The development of quantum technology made it possible to extract random sequences from quantum entropy sources. This sequence is called quantum random numbers and the whole setup is named a quantum random number generator. A suitable sampling and a physical device for the entropy source are the building blocks for a TRNG. Here we present a comparative analysis of two random number generators. Apart from the conventional statistical test for randomness, here we introduce a straightforward coefficient based on the concept of non-linearity of the Boolean function to determine the availability of any linearity in a chosen random binary sequence. It reveals the cryptographic suitability of the generated sequence w.r.t any correlation attack. A comparison of the nonlinearity of two Boolean sequences generated from two different random sources is presented.