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


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

K. Balygin

Faculty of Physics

Email: sergei.molotkov@gmail.com
俄罗斯联邦, Moscow, 119991

V. Zaitsev

Faculty of Physics

Email: sergei.molotkov@gmail.com
俄罗斯联邦, Moscow, 119991

A. Klimov

Faculty of Physics; Prokhorov General Physics Institute

Email: sergei.molotkov@gmail.com
俄罗斯联邦, Moscow, 119991; Moscow, 119991

S. Kulik

Faculty of Physics

Email: sergei.molotkov@gmail.com
俄罗斯联邦, Moscow, 119991

S. Molotkov

Institute of Solid State Physics; Academy of Cryptography of the Russian Federation; Faculty of Computational Mathematics and Cybernetics

编辑信件的主要联系方式.
Email: sergei.molotkov@gmail.com
俄罗斯联邦, Chernogolovka, Moscow region, 142432; Moscow, 121552; Moscow, 119991

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Inc., 2017