Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1506.03953 · New Journal of Physics

Randomness in post-selected events

Thinh P. Le, Gonzalo de la Torre, Jean-Daniel Bancal, Stefano Pironio, Valerio Scarani

Published Mar 7, 2016• 27 citations
arXivHTMLPDF

Abstract

Bell inequality violations can be used to certify private randomness for use in cryptographic applications. In photonic Bell experiments, a large amount of the data that is generated comes from no-detection events and presumably contains little randomness. This raises the question as to whether randomness can be extracted only from the smaller post-selected subset corresponding to proper detection events, instead of from the entire set of data. This could in principle be feasible without opening an analogue of the detection loophole as long as the min-entropy of the post-selected data is evaluated by taking all the information into account, including no-detection events. The possibility of extracting randomness from a short string has a practical advantage, because it reduces the computational time of the extraction. Here, we investigate the above idea in a simple scenario, where the devices and the adversary behave according to i.i.d. strategies. We show that indeed almost all the randomness is present in the pair of outcomes for which at least one detection happened. We further show that in some cases applying a pre-processing on the data can capture features that an analysis based on global frequencies only misses, thus resulting in the certification of more randomness. We then briefly consider non-i.i.d strategies and provide an explicit example of such a strategy that is more powerful than any i.i.d. one even in the asymptotic limit of infinitely many measurement rounds, something that was not reported before in the context of Bell inequalities.

DOI
10.1088/1367-2630/18/3/035007

Related papers

Noise robustness of three outcome Bell certified quantum randomness

Raffaele D'Avino, Ignacio Perito, Piotr Mironowicz +2 more

We investigate device-independent certification of global randomness based on Bell inequality violations in bipartite scenarios with three outcomes per party. Our goal is to determine whether multi-outcome measurements allow one to surpass the amount of randomness achievable with binary outputs in realistic scenarios. We begin by analyzing several known Bell expressions and evaluating their robustness against noise for randomness certification. We then introduce a systematic method for generating new Bell expressions within structured families and perform a large-scale numerical study. We find that a substantial number of inequalities certify significant amounts of min-entropy. In particular, we identify simple inequalities that achieve near-maximal global randomness while involving a reduced number of measurement settings, thus improving the balance between certified randomness and number of inputs. Moreover, the vast majority of nontrivial certificates exhibit robustness against realistic noise, maintaining positive certified randomness away from the ideal regime. These results demonstrate that strong device-independent randomness expansion in multi-outcome scenarios is not restricted to carefully engineered inequalities, but arises generically within suitably constructed families of Bell expressions.

quant-pharXiv:2606.21371•Jun 22, 2026•1 citation

More randomness from the same data

Jean-Daniel Bancal, Lana Sheridan, Valerio Scarani

Correlations that cannot be reproduced with local variables certify the generation of private randomness. Usually, the violation of a Bell inequality is used to quantify the amount of randomness produced. Here, we show how private randomness generated during a Bell test can be directly quantified from the observed correlations, without the need to process these data into an inequality. The frequency with which the different measurement settings are used during the Bell test can also be taken into account. This improved analysis turns out to be very relevant for Bell tests performed with a finite collection efficiency. In particular, applying our technique to the data of a recent experiment (Christensen et al 2013 Phys. Rev. Lett. 111 130406), we show that about twice as much randomness as previously reported can be potentially extracted from this setup.

arXiv:1309.3894•New Journal of Physics•Mar 7, 2014•149 citations

Regularising data for practical randomness generation

Boris Bourdoncle, Pei-Sheng Lin, Denis Rosset +2 more

Assuming that the no-signalling principle holds, non-local correlations contain intrinsic randomness. In particular, for a specific Bell experiment, one can derive relations between the amount of randomness produced, as quantified by the min-entropy of the output data, and its associated violation of a Bell inequality. In practice, due to finite sampling, certifying randomness requires the development of statistical tools to lower-bound the min-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.

arXiv:1802.04703•Quantum Science and Technology•Jan 25, 2019•3 citations

Device-independent randomness generation from several Bell estimators

Olmo Nieto-Silleras, Cédric Bamps, Jonathan Silman +1 more

Device-independent randomness generation and quantum key distribution protocols rely on a fundamental relation between the non-locality of quantum theory and its random character. This relation is usually expressed in terms of a trade-off between the probability of guessing correctly the outcomes of measurements performed on quantum systems and the amount of violation of a given Bell inequality. However, a more accurate assessment of the randomness produced in Bell experiments can be obtained if the value of several Bell expressions is simultaneously taken into account, or if the full set of probabilities characterizing the behavior of the device is considered. We introduce protocols for device-independent randomness generation secure against classical side information, that rely on the estimation of an arbitrary number of Bell expressions or even directly on the experimental frequencies of measurement outcomes. Asymptotically, this results in an optimal generation of randomness from experimental data (as measured by the min-entropy), without having to assume beforehand that the devices violate a specific Bell inequality.

arXiv:1611.00352•New Journal of Physics•Jan 23, 2018•35 citations

Using complete measurement statistics for optimal device-independent randomness evaluation

Olmo Nieto-Silleras, S Pironio, J Silman

The majority of recent works investigating the link between non-locality and randomness, e.g. in the context of device-independent cryptography, do so with respect to some specific Bell inequality, usually the CHSH inequality. However, the joint probabilities characterizing the measurement outcomes of a Bell test are richer than just the degree of violation of a single Bell inequality. In this work we show how to take this extra information into account in a systematic manner in order to optimally evaluate the randomness that can be certified from non-local correlations. We further show that taking into account the complete set of outcome probabilities is equivalent to optimizing over all possible Bell inequalities, thereby allowing us to determine the optimal Bell inequality for certifying the maximal amount of randomness from a given set of non-local correlations.

arXiv:1309.3930•New Journal of Physics•Jan 21, 2014•132 citations

Device-Independent Quantum Key Distribution with Random Postselection

Feihu Xu, Yuzhe Zhang, Qiang Zhang +1 more

Device-independent quantum key distribution (QKD) can permit the superior security even with unknown devices. In practice, however, the realization of device-independent QKD is technically challenging because of its low noise tolerance. In the photonic setup, due to the limited detection efficiency, a large amount of the data generates from no-detection events which contain few correlations but contribute high errors. Here, we propose the device-independent QKD protocol with random postselection, where the secret keys are extracted only from the postselected subset of outcomes. This could not open the detection loophole as long as the entropy of the postselected subset is evaluated from the information of the entire set of data, including both detection and no-detection events. This postselection has the advantage to significantly reduce the error events, thus relaxing the threshold of required detection efficiency. In the model of collective attacks, our protocol can tolerate detector efficiency as low as 68.5%, which goes beyond standard security proofs. The results make a concrete step for the implementation of device-independent QKD in practice.

arXiv:2110.02701•Physical Review Letters•Mar 18, 2022•63 citations
Bell inequality violations can be used to certify private randomness for use in cryptographic applications. In photonic Bell experiments, a large amount of the data that is generated comes from no-detection events and presumably contains little randomness. This raises the question as to whether randomness can be extracted only from the smaller post-selected subset corresponding to proper detection events, instead of from the entire set of data. This could in principle be feasible without opening an analogue of the detection loophole as long as the min-entropy of the post-selected data is evaluated by taking all the information into account, including no-detection events. The possibility of extracting randomness from a short string has a practical advantage, because it reduces the computational time of the extraction. Here, we investigate the above idea in a simple scenario, where the devices and the adversary behave according to i.i.d. strategies. We show that indeed almost all the randomness is present in the pair of outcomes for which at least one detection happened. We further show that in some cases applying a pre-processing on the data can capture features that an analysis based on global frequencies only misses, thus resulting in the certification of more randomness. We then briefly consider non-i.i.d strategies and provide an explicit example of such a strategy that is more powerful than any i.i.d. one even in the asymptotic limit of infinitely many measurement rounds, something that was not reported before in the context of Bell inequalities.
We investigate device-independent certification of global randomness based on Bell inequality violations in bipartite scenarios with three outcomes per party. Our goal is to determine whether multi-outcome measurements allow one to surpass the amount of randomness achievable with binary outputs in realistic scenarios. We begin by analyzing several known Bell expressions and evaluating their robustness against noise for randomness certification. We then introduce a systematic method for generating new Bell expressions within structured families and perform a large-scale numerical study. We find that a substantial number of inequalities certify significant amounts of min-entropy. In particular, we identify simple inequalities that achieve near-maximal global randomness while involving a reduced number of measurement settings, thus improving the balance between certified randomness and number of inputs. Moreover, the vast majority of nontrivial certificates exhibit robustness against realistic noise, maintaining positive certified randomness away from the ideal regime. These results demonstrate that strong device-independent randomness expansion in multi-outcome scenarios is not restricted to carefully engineered inequalities, but arises generically within suitably constructed families of Bell expressions.
Correlations that cannot be reproduced with local variables certify the generation of private randomness. Usually, the violation of a Bell inequality is used to quantify the amount of randomness produced. Here, we show how private randomness generated during a Bell test can be directly quantified from the observed correlations, without the need to process these data into an inequality. The frequency with which the different measurement settings are used during the Bell test can also be taken into account. This improved analysis turns out to be very relevant for Bell tests performed with a finite collection efficiency. In particular, applying our technique to the data of a recent experiment (Christensen et al 2013 Phys. Rev. Lett. 111 130406), we show that about twice as much randomness as previously reported can be potentially extracted from this setup.
Assuming that the no-signalling principle holds, non-local correlations contain intrinsic randomness. In particular, for a specific Bell experiment, one can derive relations between the amount of randomness produced, as quantified by the min-entropy of the output data, and its associated violation of a Bell inequality. In practice, due to finite sampling, certifying randomness requires the development of statistical tools to lower-bound the min-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.
Device-independent randomness generation and quantum key distribution protocols rely on a fundamental relation between the non-locality of quantum theory and its random character. This relation is usually expressed in terms of a trade-off between the probability of guessing correctly the outcomes of measurements performed on quantum systems and the amount of violation of a given Bell inequality. However, a more accurate assessment of the randomness produced in Bell experiments can be obtained if the value of several Bell expressions is simultaneously taken into account, or if the full set of probabilities characterizing the behavior of the device is considered. We introduce protocols for device-independent randomness generation secure against classical side information, that rely on the estimation of an arbitrary number of Bell expressions or even directly on the experimental frequencies of measurement outcomes. Asymptotically, this results in an optimal generation of randomness from experimental data (as measured by the min-entropy), without having to assume beforehand that the devices violate a specific Bell inequality.
The majority of recent works investigating the link between non-locality and randomness, e.g. in the context of device-independent cryptography, do so with respect to some specific Bell inequality, usually the CHSH inequality. However, the joint probabilities characterizing the measurement outcomes of a Bell test are richer than just the degree of violation of a single Bell inequality. In this work we show how to take this extra information into account in a systematic manner in order to optimally evaluate the randomness that can be certified from non-local correlations. We further show that taking into account the complete set of outcome probabilities is equivalent to optimizing over all possible Bell inequalities, thereby allowing us to determine the optimal Bell inequality for certifying the maximal amount of randomness from a given set of non-local correlations.
Device-independent quantum key distribution (QKD) can permit the superior security even with unknown devices. In practice, however, the realization of device-independent QKD is technically challenging because of its low noise tolerance. In the photonic setup, due to the limited detection efficiency, a large amount of the data generates from no-detection events which contain few correlations but contribute high errors. Here, we propose the device-independent QKD protocol with random postselection, where the secret keys are extracted only from the postselected subset of outcomes. This could not open the detection loophole as long as the entropy of the postselected subset is evaluated from the information of the entire set of data, including both detection and no-detection events. This postselection has the advantage to significantly reduce the error events, thus relaxing the threshold of required detection efficiency. In the model of collective attacks, our protocol can tolerate detector efficiency as low as 68.5%, which goes beyond standard security proofs. The results make a concrete step for the implementation of device-independent QKD in practice.