Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userParallel and real-time post-processing for quantum random number generators
106
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Quantum random number generators (QRNG) based on continuous variable (CV) quantum fluctuations offer great potential for their advantages in measurement bandwidth, stability and integrability. More importantly, it provides an efficient and extensible path for significant promotion of QRNG generation rate. During this process, real-time randomness extraction using information theoretically secure randomness extractors is vital, because it plays critical role in the limit of throughput rate and implementation cost of QRNGs. In this work, we investigate parallel and real-time realization of several Toeplitz-hashing extractors within one field-programmable gate array (FPGA) for parallel QRNG. Elaborate layout of Toeplitz matrixes and efficient utilization of hardware computing resource in the FPGA are emphatically studied. Logic source occupation for different scale and quantity of Toeplitz matrices is analyzed and two-layer parallel pipeline algorithm is delicately designed to fully exploit the parallel algorithm advantage and hardware source of the FPGA. This work finally achieves a real-time post-processing rate of QRNG above 8 Gbps. Matching up with integrated circuit for parallel extraction of multiple quantum sideband modes of vacuum state, our demonstration shows an important step towards chip-based parallel QRNG, which could effectively improve the practicality of CV QRNGs, including device trusted, device-independent, and semi-device-independent schemes.
rate research
Read More
Quantum random number generation exploits inherent randomness of quantum mechanical processes and measurements. Real-time generation rate of quantum random numbers is usually limited by electronic bandwidth and data processing rates. Here we use a multiplexing scheme to create a fast real-time quantum random number generator based on continuous variable vacuum fluctuations. Multiple sideband frequency modes of a quantum vacuum state within a homodyne detection bandwidth are concurrently extracted as the randomness source. Parallel post-processing of raw data from three sub-entropy sources is realized in one field-programmable gate array (FPGA) based on Toeplitz-hashing extractors. A cumulative generation rate of 8.25 Gbps in real-time is achieved. The system relies on optoelectronic components and circuits that could be integrated in a compact, economical package.
Random numbers are a fundamental ingredient for many applications including simulation, modelling and cryptography. Sound random numbers should be independent and uniformly distributed. Moreover, for cryptographic applications they should also be unpredictable. We demonstrate a real-time self-testing source independent quantum random number generator (QRNG) that uses squeezed light as source. We generate secure random numbers by measuring the quadratures of the electromagnetic field without making any assumptions on the source; only the detection device is trusted. We use a homodyne detection to alternatively measure the Q and P conjugate quadratures of our source. Using the entropic uncertainty relation, measurements on P allow us to estimate a bound on the min-entropy of Q conditioned on any classical or quantum side information that a malicious eavesdropper may detain. This bound gives the minimum number of secure bits we can extract from the Q measurement. We discuss the performance of different estimators for this bound. We operate this QRNG with a squeezed state and we compare its performance with a QRNG using thermal states. The real-time bit rate was 8.2 kb/s when using the squeezed source and between 5.2-7.2 kb/s when the thermal state source was used.
We present a simple and robust construction of a real-time quantum random number generator (QRNG). Our minimalist approach ensures stable operation of the device as well as its simple and straightforward hardware implementation as a stand-alone module. As a source of randomness the device uses measurements of time intervals between clicks of a single-photon detector. The obtained raw sequence is then filtered and processed by a deterministic randomness extractor, which is realized as a look-up table. This enables high speed on-the-fly processing without the need of extensive computations. The overall performance of the device is around 1 random bit per detector click, resulting in 1.2 Mbit/s generation rate in our implementation.
We present a random number generation scheme based on measuring the phase fluctuations of a laser with a simple and compact experimental setup. A simple model is established to analyze the randomness and the simulation result based on this model fits well with the experiment data. After the analog to digital sampling and suitable randomness extraction integrated in the field programmable gate array, the final random bits are delivered to a PC, realizing a 5.4 Gbps real time quantum random number generation. The final random bit sequences have passed all the NIST and DIEHARD tests.
The problem of constructing effective statistical tests for random number generators (RNG) is considered. Currently, there are hundreds of RNG statistical tests that are often combined into so-called batteries, each containing from a dozen to more than one hundred tests. When a battery test is used, it is applied to a sequence generated by the RNG, and the calculation time is determined by the length of the sequence and the number of tests. Generally speaking, the longer the sequence, the smaller deviations from randomness can be found by a specific test. So, when a battery is applied, on the one hand, the better tests are in the battery, the more chances to reject a bad RNG. On the other hand, the larger the battery, the less time can be spent on each test and, therefore, the shorter the test sequence. In turn, this reduces the ability to find small deviations from randomness. To reduce this trade-off, we propose an adaptive way to use batteries (and other sets) of tests, which requires less time but, in a certain sense, preserves the power of the original battery. We call this method time-adaptive battery of tests.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
