Abstract:
The paper presents a method for extracting provably random bit sequences from several independent trajectories of circuits Markov, each of which has an arbitrary finite order. The combined use of several trajectories makes it possible in practice, when implementing quantum randomnumber generators, to significantly increase the speed of generating output bit sequences.
Keywords:quantum random number generators, random sequences, Markov chains, provable randomness.
UDC:519.676
Presented:A. M. Sergeev Received: 26.11.2024 Revised: 16.01.2025 Accepted: 24.02.2025