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

Journal of Experimental and Theoretical Physics Letters

Implementation of a quantum random number generator based on the optimal clustering of photocounts

Kirill A. Balygin, Vladimir Y. Zaitsev, Andrey N. Klimov, S. P. Kulik, S. N. Molotkov

Published Oct 1, 2017• 10 citations
Publisher

Abstract

To implement quantum random number generators, it is fundamentally important to have a mathematically provable and experimentally testable process of measurements of a system from which an initial random sequence is generated. This makes sure that randomness indeed has a quantum nature. A quantum random number generator has been implemented with the use of the detection of quasi-single-photon radiation by a silicon photomultiplier (SiPM) matrix, which makes it possible to reliably reach the Poisson statistics of photocounts. The choice and use of the optimal clustering of photocounts for the initial sequence of photodetection events and a method of extraction of a random sequence of 0’s and 1’s, which is polynomial in the length of the sequence, have made it possible to reach a yield rate of 64 Mbit/s of the output certainly random sequence.

DOI
10.1134/s0021364017190043

Related papers

A Quantum Random Number Generator Based on the 100-Mbit/s Poisson Photocount Statistics

Kirill A. Balygin, Vladimir Y. Zaitsev, Andrey N. Klimov +2 more

A quantum random number generator is experimentally realized. The initial randomness source is a sequence of photocounts from quasi-single-photon radiation detected with a SiPM (Silicon Photo Multiplier) silicon avalanche detector array. The use of a SiPM provides a reliable control of the quantum nature of the Poisson photocount statistics. A special algorithm with nonexponential complexity allows one to extract from the Poisson process all the randomness contained in it, namely, a random uniform sequence of 0 and 1.

Journal of Experimental and Theoretical Physics•Jun 1, 2018•29 citations

Quantum random number generator based on ‘Fermi–Dirac’ statistics of photocounts of faint laser pulses with a 75 Mbit s −1 rate

Kirill A. Balygin, Vladimir Y. Zaitsev, Andrey N. Klimov +4 more

Abstract We implemented experimentally a quantum random number generator, based on the registration of quasi-single-photon light by a silicon photo-multiplier, which allows one to reliably achieve the Poisson statistics of photocounts. The use of the optimal grouping of photocounts and a polynomial-length sequence of the method for extracting the random sequence 0 and 1 made it possible to achieve the output rate of a provably random sequence up to 75 Mbit s − 1 .

Laser Physics Letters•Nov 23, 2017•6 citations

Implementation of a Quantum Generator of Random Numbers: Extraction of Provably Random Bit Sequences from Correlated Markov Chains

Kirill A. Balygin, S. P. Kulik, S. N. Molotkov

An experimental implementation of a quantum random number generator has been proposed. A new method for the extraction of provably random bit sequences from correlated sequences of photocounts, which are Markov chains, has been implemented experimentally for the first time. The reached generation rate of bits 0 and 1 is 154.5 Mbit/s. Fundamental natural constraints on the achievement of perfect true randomness are also discussed.

Journal of Experimental and Theoretical Physics Letters•Apr 1, 2024•6 citations

Quantum Random Number Generation Based on Multi-photon Detection

Kanin Aungskunsiri, Sakdinan Jantarachote, Kruawan Wongpanya +3 more

We demonstrate quantum random number generation based on a photon-number detection scheme with the use of a silicon photomultiplier. We implement a time integral with detector response signals for resolving photon numbers, which are subsequently digitized into a stream of 4-bit sequences with a generation rate of 13.6 Mbit/s. Our generated random bits pass the statistical randomness validation according to the U.S. National Institute of Standards and Technology (NIST) Special Publication 800-22. This scheme is implementable with inexpensive components, and the system can be miniaturized to the size of a plug-and-play portable cryptographic device.

ACS Omega•Sep 11, 2023•6 citations

On the limiting characteristics of quantum random number generators at various clusterings of photocounts

S. N. Molotkov

Various methods for the clustering of photocounts constituting a sequence of random numbers are considered. It is shown that the clustering of photocounts resulting in the Fermi–Dirac distribution makes it possible to achieve the theoretical limit of the random number generation rate.

Journal of Experimental and Theoretical Physics Letters•Mar 1, 2017•10 citations

Photon arrival time quantum random number generation

Michael A. Wayne, Evan R. Jeffrey, Gleb M. Akselrod +1 more

We present an efficient random number generator based on the randomness present in photon emission and detection. The interval between successive photons from a light source with Poissonian statistics is separated into individual time bins, which are then used to create several random bits per detection event. Using a single-photon counter and FPGA-based data processing allows for a cost-efficient and convenient implementation that outputs data at rates of roughly 40 Mbit s−1.

Journal of Modern Optics•Jan 27, 2009•135 citations
To implement quantum random number generators, it is fundamentally important to have a mathematically provable and experimentally testable process of measurements of a system from which an initial random sequence is generated. This makes sure that randomness indeed has a quantum nature. A quantum random number generator has been implemented with the use of the detection of quasi-single-photon radiation by a silicon photomultiplier (SiPM) matrix, which makes it possible to reliably reach the Poisson statistics of photocounts. The choice and use of the optimal clustering of photocounts for the initial sequence of photodetection events and a method of extraction of a random sequence of 0’s and 1’s, which is polynomial in the length of the sequence, have made it possible to reach a yield rate of 64 Mbit/s of the output certainly random sequence.
A quantum random number generator is experimentally realized. The initial randomness source is a sequence of photocounts from quasi-single-photon radiation detected with a SiPM (Silicon Photo Multiplier) silicon avalanche detector array. The use of a SiPM provides a reliable control of the quantum nature of the Poisson photocount statistics. A special algorithm with nonexponential complexity allows one to extract from the Poisson process all the randomness contained in it, namely, a random uniform sequence of 0 and 1.
We demonstrate quantum random number generation based on a photon-number detection scheme with the use of a silicon photomultiplier. We implement a time integral with detector response signals for resolving photon numbers, which are subsequently digitized into a stream of 4-bit sequences with a generation rate of 13.6 Mbit/s. Our generated random bits pass the statistical randomness validation according to the U.S. National Institute of Standards and Technology (NIST) Special Publication 800-22. This scheme is implementable with inexpensive components, and the system can be miniaturized to the size of a plug-and-play portable cryptographic device.