Efficient randomness certification by quantum probability estimation

Zhang, Yanbao; Fu, Honghao; Knill, Emanuel

doi:10.1103/physrevresearch.2.013016

Cited by 41 publications

(40 citation statements)

References 47 publications

(161 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For certifying randomness with respect to classical and quantum side information, we construct probability estimation factors (PEFs) 25 , 26 and quantum estimation factors (QEFs) 27 , 28 , respectively. Both a PEF and a QEF are non-negative functions of the input I and output O of a trial, denoted by F c ( I , O ) and F q ( I , O ).…”

Section: Resultsmentioning

confidence: 99%

“…We emphasize that PEFs and QEFs can use the result of each trial for both verifying and accumulating randomness. Both PEFs and QEFs have been constructed for certifying device-independent randomness 15 , 25 – 28 . In this work, we develop methods to construct PEFs and QEFs for the scenario of our interest.…”

Section: Resultsmentioning

confidence: 99%

“…To certify randomness with respect to the quantum side information of Eve, we apply the framework of quantum probability estimation as developed in refs. 27 , 28 . For this, we need to characterize each trial of the experiment by a quantum model.…”

Section: Methodsmentioning

confidence: 99%

“…Second, according to Property 2 of ref. 28 , a QEF with power β q for the model is also a QEF with the same power for the convex closure of . In view of the above two remarks, quantum probability estimation automatically handles the classical correlation between Eve’s quantum side information about the state and Eve’s partial knowledge of the input and measurement at a trial.…”

Section: Methodsmentioning

confidence: 99%

See 3 more Smart Citations

A simple low-latency real-time certifiable quantum random number generator

Zhang

Mink

et al. 2021

Nat Commun

Self Cite

View full text Add to dashboard Cite

Quantum random numbers distinguish themselves from others by their intrinsic unpredictability arising from the principles of quantum mechanics. As such they are extremely useful in many scientific and real-world applications with considerable efforts going into their realizations. Most demonstrations focus on high asymptotic generation rates. For this goal, a large number of repeated trials are required to accumulate a significant store of certifiable randomness, resulting in a high latency between the initial request and the delivery of the requested random bits. Here we demonstrate low-latency real-time certifiable randomness generation from measurements on photonic time-bin states. For this, we develop methods to certify randomness taking into account adversarial imperfections in both the state preparation and the measurement apparatus. Every 0.12 s we generate a block of 8192 random bits which are certifiable against all quantum adversaries with an error bounded by 2−64. Our quantum random number generator is thus well suited for realizing a continuously-operating, high-security and high-speed quantum randomness beacon.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Section: Methodsmentioning

confidence: 99%

Section: Methodsmentioning

confidence: 99%

See 2 more Smart Citations

A simple low-latency real-time certifiable quantum random number generator

Zhang

Mink

et al. 2021

Nat Commun

Self Cite

View full text Add to dashboard Cite

show abstract

“…Recently, we also generalized exact probability estimation for certifying randomness with respect to quantum side information, see Refs. [29,30].…”

Section: Introductionmentioning

confidence: 99%

Generation of quantum randomness by probability estimation with classical side information

Knill

Zhang

Bierhorst

2020

Phys. Rev. Research

Self Cite

View full text Add to dashboard Cite

We develop the framework of probability estimation for certifying randomness with respect to classical side information from a sequence of Bell-test or other randomness-generating trials. The framework is based on directly estimating the probability of measurement outcomes conditional on settings choices and classical side information with adaptive test supermartingales. Accordingly, the number of trials needs not to be predetermined, and one can stop performing trials early, as soon as the desired amount of randomness is extractable. It can be used with arbitrary, partially known and time-varying probabilities for the random settings choices. It can also adapt to other time-varying experimental parameters. Furthermore, it is suitable for application to experiments with low Bell violation per trial, such as current optical loophole-free Bell tests. Compared with our previous work [Phys. Rev. A 98 040304(R) (2018)], here we formulate the framework for the general situation where the randomness can be extracted from a sequence of private data determined in an arbitrary way by the measurement outcomes of the trials. Trial-wise probability estimators can be adapted using all accessible, private information in addition to the results of previous trials. We prove that probability estimation achieves the asymptotically optimal rate for certified randomness generation and makes possible the exponential expansion of settings entropy. We implement probability estimation numerically and apply it to a representative settings-conditional distribution of the measurement outcomes from an atomic loophole-free Bell test [W. Rosenfeld et al., Phys. Rev. Lett. 119, 010402 (2017)] to illustrate trade-offs between the amount of randomness, error, settings entropy, adversarial settings bias, and number of trials. We then show that probability estimation yields more randomness from the optical loophole-free Bell-test data analyzed in [P. Bierhorst et al., arXiv:1702.05178v1] and tolerates adversarial settings biases.

show abstract

Showcase: Device-Independent Quantum Cryptography

Arnon-Friedman

2020

Device-Independent Quantum Information Processing

View full text Add to dashboard Cite

Efficient randomness certification by quantum probability estimation

Cited by 41 publications

References 47 publications

A simple low-latency real-time certifiable quantum random number generator

A simple low-latency real-time certifiable quantum random number generator

Generation of quantum randomness by probability estimation with classical side information

Showcase: Device-Independent Quantum Cryptography

Contact Info

Product

Resources

About