Abstract
The generation of series of random numbers is an important and difficult problem. Appropriate measurements on entangled states have been proposed as the definitive solution to produce series of certified randomness, and quantum optical systems play a major role. However, several reports indicate that random number generators based on quantum measurements have a high rate of series rejected by standard tests of randomness. This is believed to be caused by experimental imperfections and is usually solved by using classical algorithms to extract randomness. This is acceptable to generate random numbers in a single place. In quantum key distribution (QKD) instead, if the extractor is known by an eavesdropper (a situation that cannot be ruled out), the key's security may be menaced. We use a not-loophole-free, "toy" all-fiber-optic-based setup, mimicking a QKD one operating in the field, to generate binary series and evaluate their level of randomness according to Ville's principle. The series are tested with a battery of indicators of statistical and algorithmic randomness and nonlinear analysis. The good performance of a simple method to get random series from rejected ones, previously reported by Solis et al. is confirmed and supported with additional arguments. Incidentally, a theoretically predicted relationship between complexity and entropy is verified. Regarding QKD, the level of randomness of series, obtained by applying Toeplitz's extractor to rejected series, is found to be indistinguishable from the level of non-rejected raw ones.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.