论文标题
测试贝尔实验中生成的串联的随机性
Testing randomness of series generated in Bell's experiment
论文作者
论文摘要
一系列随机数是一个重要且困难的问题。即使是随机的定义也很困难。已经提出了对纠缠状态的适当测量,作为产生一系列认证随机性的确定解决方案。但是,一些报告表明,基于量子的设备显示出令人失望的串联速率,该串联速率被标准的随机性测试拒绝。通常,使用名为提取器的算法来解决此问题,但是如果窃听器知道提取器(无法排除的情况),则QKD设置中的关键安全性可能会受到威胁。我们使用基于玩具光纤的设置,类似于在现场使用的QKD QKD,以生成二进制系列,并根据Ville原理评估它们的随机性水平。用一系列标准统计指标,Hurst指数,Kolmogorov复杂性,最小熵,嵌入式的Takens维度以及增强的Dickey Fuller和Kwiatkowski Phillips Schmidt Schmidt Schin Shin进行测试。观察到复杂性与最小熵之间的理论预测关系。 Solis等人报道的简单方法是从拒绝系列中获得有用系列的良好性能,并得到了其他参数的支持。关于QKD,发现通过将Toeplitz提取器应用于被拒绝的系列获得的串联的随机性水平与非拒绝原始原始级别的水平没有区别。
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, minimum entropy, Takens dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check stationarity. A theoretically predicted relationship between complexity and minimum entropy is observed. The good performance of a simple method to get useful series from rejected series, reported by Solis et al, is confirmed and supported with additional arguments. Regarding QKD, the level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.