On the Extraction of Random Bit Sequences in Quantum Random Number Generators with Several Independent Markov Sources

IF 0.6 4区数学 Q3 MATHEMATICS

Doklady Mathematics Pub Date : 2025-10-17 DOI:10.1134/S1064562424602701

I. M. Arbekov, S. N. Molotkov

引用次数: 0

Abstract

The paper presents a method for extracting provably random bit sequences from several independent Markov chain trajectories, each having an arbitrary finite order. In implementing quantum random number generators, the combined use of several trajectories makes it possible to significantly increase the speed of generating output bit sequences.

查看原文本刊更多论文

若干独立马尔可夫源量子随机数发生器中随机比特序列的提取

本文提出了一种从几个独立的马尔可夫链轨迹中提取可证明随机比特序列的方法，每个轨迹都具有任意有限阶。在实现量子随机数生成器时，结合使用几个轨迹可以显著提高生成输出位序列的速度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Doklady Mathematics 数学-数学

CiteScore

1.00

自引率

16.70%

发文量

审稿时长

3-6 weeks

期刊介绍： Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.