Testing randomness of series generated in Bell's experiment

• URL: http://arxiv.org/abs/2208.14986v1
• Date: Wed, 31 Aug 2022 17:39:29 GMT
• Title: Testing randomness of series generated in Bell's experiment
• Authors: Myriam Nonaka, M\'onica Ag\"uero, Marcelo Kovalsky and Alejandro Hnilo
• Abstract summary: We use a toy fiber optic based setup 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, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent. 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.
• Score: 62.997667081978825
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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, 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.

Related papers

• Improvements on Device Independent and Semi-Device Independent Protocols of Randomness Expansion [0.0]
  Device Independent (DI) and Semi-Device Independent (semi-DI) protocols of randomness expansion are discussed. We introduce enhanced DI and semi-DI protocols that surpass existing ones in terms of output randomness rate, security, or in some instances, both. A notable contribution is the introduction of randomness expansion protocols that recycle input randomness, significantly enhancing finite round randomness rates for DI protocols based on the CHSH inequality violation.
  arXiv  Detail & Related papers  (2023-11-22T17:03:04Z)
• Non Deterministic Pseudorandom Generator for Quantum Key Distribution [0.0]
  Quantum Key Distribution thrives to achieve perfect secrecy of One time Pad (OTP) through quantum processes. One of the crucial components of QKD are Quantum Random Number Generators(QRNG) for generation of keys. This paper proposes a pseudorandom generator based on post quantum primitives.
  arXiv  Detail & Related papers  (2023-11-06T11:03:03Z)
• Generalized Time-bin Quantum Random Number Generator with Uncharacterized Devices [0.0]
  This work analyzes evolutions in the extractable amount of randomness with increasing the Hilbert space dimension. We investigate the generic case of time-bin encoding scheme, define various input (state preparation) and outcome (measurement) subspaces. We demonstrate that this approach can boost the system entropy, resulting in more extractable randomness.
  arXiv  Detail & Related papers  (2023-05-05T15:53:22Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Shortcomings of Top-Down Randomization-Based Sanity Checks for Evaluations of Deep Neural Network Explanations [67.40641255908443]
  We identify limitations of model-randomization-based sanity checks for the purpose of evaluating explanations. Top-down model randomization preserves scales of forward pass activations with high probability.
  arXiv  Detail & Related papers  (2022-11-22T18:52:38Z)
• Secure bound analysis of quantum key distribution with non-uniform random seed of privacy amplification [2.580765958706854]
  We show that when the average min-entropy of the random number generator is below 0.95, the secure bound of a QKD system will be seriously affected.
  arXiv  Detail & Related papers  (2022-07-18T01:45:50Z)
• E-detectors: a nonparametric framework for sequential change detection [86.15115654324488]
  We develop a fundamentally new and general framework for sequential change detection. Our procedures come with clean, nonasymptotic bounds on the average run length. We show how to design their mixtures in order to achieve both statistical and computational efficiency.
  arXiv  Detail & Related papers  (2022-03-07T17:25:02Z)
• Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
  We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN) In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent. This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
  arXiv  Detail & Related papers  (2021-03-17T21:49:53Z)
• Improved device-independent randomness expansion rates using two sided randomness [3.4376560669160394]
  A device-independent randomness expansion protocol aims to take an initial random string and generate a longer one. We investigate the possible improvement that could be gained using the two-sided randomness. We also consider a modified protocol in which the input randomness is recycled.
  arXiv  Detail & Related papers  (2021-03-12T19:49:17Z)
• Stochastic Saddle-Point Optimization for Wasserstein Barycenters [69.68068088508505]
  We consider the populationimation barycenter problem for random probability measures supported on a finite set of points and generated by an online stream of data. We employ the structure of the problem and obtain a convex-concave saddle-point reformulation of this problem. In the setting when the distribution of random probability measures is discrete, we propose an optimization algorithm and estimate its complexity.
  arXiv  Detail & Related papers  (2020-06-11T19:40:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.