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

International Balkan Conference on Communications and Networking (BalkanCom)

Experimental Time-of-Arrival Quantum Random Number Generation with Dead Time Overestimation

Ágoston Schranz, Balázs Solymos, Miklós Telek

Published Jun 3, 2024• 0 citations
Publisher

Abstract

A measurement-based validation of theoretical results on quantum random number generators (QRNGs) is considered in the paper. We have designed an experimental setup built around a single-photon detector to record random datasets of photon arrival time differences with various parameter settings. The collected datasets are used to generate random bit sequences with and without dead time overestimation. The statistical properties of the bit sequences are compared with analytical results on the one hand and assessed with four of the most popular statistical test suites on the other hand. The measurement results validate that the dead time overestimation algorithm helps to eliminate unwanted correlations from the generated bit sequences in practice.

DOI
10.1109/balkancom61808.2024.10557176

Related papers

Correlation avoidance in single-photon detecting quantum random number generators by dead time overestimation

Balázs Solymos, Ágoston Schranz, Miklós Telek

Abstract In the case of quantum random number generators based on single photon arrivals, the physical properties of single-photon detectors, such as time-tagger clocks and dead time, influence the stochastic properties of the generated random numbers. This can lead to unwanted correlations among consecutive samples. We present a method based on extending the insensitive periods after photon detections. This method eliminates the unwanted stochastic effects at the cost of reduced generation speed. We calculate performance measures for our presented method and verify its correctness with computer simulations and measurements conducted on an experimental setup. Our algorithm has low complexity, making it convenient to implement in QRNG schemes, where the benefits of having uncorrelated output intervals exceed the disadvantages of the decreased rate.

EPJ Quantum Technology•Sep 19, 2024•4 citations

High-speed quantum-random number generation by continuous measurement of arrival time of photons

Qiurong Yan, Baosheng Zhao, Hua Zhang +2 more

We demonstrate a novel high speed and multi-bit optical quantum random number generator by continuously measuring arrival time of photons with a common starting point. To obtain the unbiased and post-processing free random bits, the measured photon arrival time is converted into the sum of integral multiple of a fixed period and a phase time. Theoretical and experimental results show that the phase time is an independent and uniform random variable. A random bit extraction method by encoding the phase time is proposed. An experimental setup has been built and the unbiased random bit generation rate could reach 128 Mb/s, with random bit generation efficiency of 8 bits per detected photon. The random numbers passed all tests in the statistical test suite.

Review of Scientific Instruments•Jul 1, 2015•31 citations

Secure post-processing for non-ideal photon arrival time based quantum random number generator

Balázs Solymos, László Bacsárdi

Utilizing the inherently unpredictable nature of quantum mechanics, quantum random number generators (QRNGs) can provide randomness for applications where quality entropy (like in the case of cryptography) is essential. We present a post-processing scheme utilizing min-entropy estimation and hashing for optical QRNGs based on measuring individual photon arrival times. Our method allows for the handling of possible errors due to non-ideal components or even a potential attacker, given some basic assumptions to reliably produce a safe, good quality, uniformly distributed bitstream as output. We validate our results with an intentionally non-ideal measurement setup to show robustness, while also statistically testing our final output with four popular statistical test suites.

Híradástechnika/Infocommunications journal•Jan 1, 2024•1 citation

Efficiency improvement of photon arrival time based quantum random number generator with hashing

Balázs Solymos, László Bacsárdi

Quantum random number generators can deliver entropy based on inherently non-deterministic physical phenomena, which is essential for applications where quality randomness is needed (e.g. in cryptography). Our generator based on photon time-of-arrival exploits the randomness of light emission in semiconductors. To measure the time between detections we use a continuous (non-restartable) clock for time tagging, which permits simpler hardware but produces slightly different output from the optimal exponential distribution. To handle this and produce quality output, we use Toeplitz hashing based bit generation after modeling and calculating a lower bound of extractable min-entropy for the general case of this generation scheme with a continuous clock. We produced uniformly distributed output bits with our setup, while also reaching a generation efficiency of 9.75 output bits per 16-bit input record, which is an improvement to our previously used method. Our generator has also been statistically tested using four of the popular statistical test suites.

IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)•May 23, 2023•1 citation

Modeling of a New Photonic Quantum Random Number Generation Method

Ágoston Schranz, Balázs Solymos, Miklós Telek

Abstract A bit generation algorithm of a photon arrival times based quantum random number generator is proposed and investigated in terms of the quality of generated bits, bit generation efficiency and bit generation rate. The method's performance is analyzed mathematically, considering the properties of the physical equipment, such as discretized time measurement, inaccurate knowledge about the photon arrival rate and dead time. The proposed bit generation algorithm is also tested in a physical experiment.

•Feb 20, 2026•0 citations

Experimental demonstration of high-entropy time of arrival based optical QRNG qualifying stringent statistical tests

Anindita Banerjee, Anuj Sethia, Vijayalaxmi Mogiligidda +4 more

We report a demonstration of a high-entropy optical quantum random number generator (QRNG) based on photon arrival time. We have implemented the scheme with high-speed and high-precision electronics with a time resolution of 1 ps generating 115 Mbps raw data. The random bit generation efficiency is 8 bits per detection. The experimental data is quite consistent with theoretical estimation showing minimum bias. We apply a real-time information-theoretic randomness extractor to generate a final data rate of 109 Mbps. The randomness is rigorously evaluated against well-known statistical test suites of NIST, ENT, Diehard, TU-01 and Dieharder.

arXiv:2108.06112•Aug 13, 2021•2 citations
A measurement-based validation of theoretical results on quantum random number generators (QRNGs) is considered in the paper. We have designed an experimental setup built around a single-photon detector to record random datasets of photon arrival time differences with various parameter settings. The collected datasets are used to generate random bit sequences with and without dead time overestimation. The statistical properties of the bit sequences are compared with analytical results on the one hand and assessed with four of the most popular statistical test suites on the other hand. The measurement results validate that the dead time overestimation algorithm helps to eliminate unwanted correlations from the generated bit sequences in practice.
Abstract In the case of quantum random number generators based on single photon arrivals, the physical properties of single-photon detectors, such as time-tagger clocks and dead time, influence the stochastic properties of the generated random numbers. This can lead to unwanted correlations among consecutive samples. We present a method based on extending the insensitive periods after photon detections. This method eliminates the unwanted stochastic effects at the cost of reduced generation speed. We calculate performance measures for our presented method and verify its correctness with computer simulations and measurements conducted on an experimental setup. Our algorithm has low complexity, making it convenient to implement in QRNG schemes, where the benefits of having uncorrelated output intervals exceed the disadvantages of the decreased rate.
We demonstrate a novel high speed and multi-bit optical quantum random number generator by continuously measuring arrival time of photons with a common starting point. To obtain the unbiased and post-processing free random bits, the measured photon arrival time is converted into the sum of integral multiple of a fixed period and a phase time. Theoretical and experimental results show that the phase time is an independent and uniform random variable. A random bit extraction method by encoding the phase time is proposed. An experimental setup has been built and the unbiased random bit generation rate could reach 128 Mb/s, with random bit generation efficiency of 8 bits per detected photon. The random numbers passed all tests in the statistical test suite.
Utilizing the inherently unpredictable nature of quantum mechanics, quantum random number generators (QRNGs) can provide randomness for applications where quality entropy (like in the case of cryptography) is essential. We present a post-processing scheme utilizing min-entropy estimation and hashing for optical QRNGs based on measuring individual photon arrival times. Our method allows for the handling of possible errors due to non-ideal components or even a potential attacker, given some basic assumptions to reliably produce a safe, good quality, uniformly distributed bitstream as output. We validate our results with an intentionally non-ideal measurement setup to show robustness, while also statistically testing our final output with four popular statistical test suites.
Quantum random number generators can deliver entropy based on inherently non-deterministic physical phenomena, which is essential for applications where quality randomness is needed (e.g. in cryptography). Our generator based on photon time-of-arrival exploits the randomness of light emission in semiconductors. To measure the time between detections we use a continuous (non-restartable) clock for time tagging, which permits simpler hardware but produces slightly different output from the optimal exponential distribution. To handle this and produce quality output, we use Toeplitz hashing based bit generation after modeling and calculating a lower bound of extractable min-entropy for the general case of this generation scheme with a continuous clock. We produced uniformly distributed output bits with our setup, while also reaching a generation efficiency of 9.75 output bits per 16-bit input record, which is an improvement to our previously used method. Our generator has also been statistically tested using four of the popular statistical test suites.
Abstract A bit generation algorithm of a photon arrival times based quantum random number generator is proposed and investigated in terms of the quality of generated bits, bit generation efficiency and bit generation rate. The method's performance is analyzed mathematically, considering the properties of the physical equipment, such as discretized time measurement, inaccurate knowledge about the photon arrival rate and dead time. The proposed bit generation algorithm is also tested in a physical experiment.
We report a demonstration of a high-entropy optical quantum random number generator (QRNG) based on photon arrival time. We have implemented the scheme with high-speed and high-precision electronics with a time resolution of 1 ps generating 115 Mbps raw data. The random bit generation efficiency is 8 bits per detection. The experimental data is quite consistent with theoretical estimation showing minimum bias. We apply a real-time information-theoretic randomness extractor to generate a final data rate of 109 Mbps. The randomness is rigorously evaluated against well-known statistical test suites of NIST, ENT, Diehard, TU-01 and Dieharder.