.png){kind=icon}
Return
Regularising data for practical randomness generation
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/ab01e8.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Assuming that the no-signalling principle holds, non-local correlations contain intrinsic randomness. In particular, for a specificBell experiment, one can derive relations between the amount of randomness produced, as quantified by themin-entropy of the output data, and its associated violation of a Bell inequality. In practice, due tofinite sampling, certifying randomness requires the development of statistical tools to lower-bound themin-entropy of the data as a function of the estimated Bell violation. The quality of such bounds relies on the choice of certificate, i.e. the Bell inequality whose violation is estimated. In this work, we propose a method for choosing efficiently such a certificate and analyse, by means of extensive numerical simulations (with various choices of parameters), the extent to which it works. The method requires sacrificing a part of the output data in order to estimate the underlying correlations. Regularising this estimate then allows one to find a Bell inequality that is well suited for certifying practical randomness from these specific correlations. We then study the effects of various parameters on the obtained min-entropy bound and explain how to tune them in a favourable way. Lastly, we carry out several numerical simulations of a Bell experiment to show the efficiency of our method: we nearly always obtain higher min-entropy rates than when we use a pre-established Bell inequality, namely the Clauser-Horne-Shimony-Holt inequality.
Keywords:
Randomness generation
Bell nonlocality
device-independent information processing
quantum information theory
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
1.4K
Citations:
5.1K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveConvergence analysis of a global optimization algorithm using stochastic differential equations
PREAI
ShareSaveShareSave
ShareSaveShareSave
View more