Randomness in post-selected events
Le Phuc Thinh, Gonzalo de la Torre, Jean-Daniel Bancal, Stefano, Pironio, Valerio Scarani

TL;DR
This paper explores extracting private randomness from post-selected detection events in Bell experiments, demonstrating that most randomness resides in detection outcomes and that pre-processing can enhance certification, even considering complex strategies.
Contribution
It shows that almost all randomness is in detection events and introduces methods to improve randomness certification, including handling non-i.i.d. strategies.
Findings
Most randomness is in detection events with at least one detection
Pre-processing can reveal additional certifiable randomness
Non-i.i.d. strategies can outperform i.i.d. ones asymptotically
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…
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.
