Testing randomness of series generated in Bell's experiment
Myriam Nonaka, M\'onica Ag\"uero, Marcelo Kovalsky, Alejandro Hnilo

TL;DR
This paper evaluates the randomness of series generated in Bell's experiment using various statistical tests and explores the security implications for quantum key distribution, confirming the effectiveness of certain extraction methods.
Contribution
It introduces a comprehensive testing approach for randomness in Bell's experiment series and assesses the security impact of extraction methods in QKD.
Findings
Series pass standard randomness tests.
Complexity correlates with minimum entropy.
Extraction methods do not compromise randomness quality.
Abstract
The generation of series of random numbers is an important and difficult problem. Even the very definition of random is difficult. Appropriate measurements on entangled states have been proposed as the definitive solution to produce series of certified randomness. However, several reports indicate that quantum based devices show a disappointing rate of series rejected by standard tests of randomness. This problem is usually solved by using algorithms named extractors but, if the extractor were known by an eavesdropper (a situation that cannot be ruled out) the key security in QKD setups may be menaced. We use a toy fiber optic based setup, similar to a QKD one to be used in the field, to generate binary series, and evaluate their level of randomness according to Ville principle. Series are tested with a battery of standard statistical indicators, Hurst exponent, Kolmogorov complexity,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Scientific Computing and Data Management · Benford’s Law and Fraud Detection
