Implementation of a quantum random number generator based on the optimal clustering of photocounts |
| |
| Authors: | K A Balygin V I Zaitsev A N Klimov S P Kulik S N Molotkov |
| |
| Institution: | 1.Faculty of Physics,Moscow State University,Moscow,Russia;2.Prokhorov General Physics Institute,Russian Academy of Sciences,Moscow,Russia;3.Institute of Solid State Physics,Russian Academy of Sciences,Chernogolovka,Russia;4.Academy of Cryptography of the Russian Federation,Moscow,Russia;5.Faculty of Computational Mathematics and Cybernetics,Moscow State University,Moscow,Russia |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
