Abstract

For practical applications of quantum randomness generation, it is important to certify and further produce a fixed block of fresh random bits with as few trials as possible. Consequently, protocols with high finite-data efficiency are preferred. To yield such protocols with respect to quantum side information, we develop quantum probability estimation. Our approach is applicable to device-independent as well as device-dependent scenarios, and it generalizes techniques from previous works [Miller and Shi, SIAM Journal on Computing 46, 1304 (2017); Arnon-Friedman et al., Nature Communications 9, 459 (2018)]. Quantum probability estimation can adapt to changing experimental conditions, allows stopping the experiment as soon as the prespecified randomness goal is achieved, and can tolerate imperfect knowledge of the input distribution. Moreover, the randomness rate achieved at constant error is asymptotically optimal. For the device-independent scenario, our approach certifies the amount of randomness available in experimental results without first searching for relations between randomness and violations of fixed Bell inequalities. We implement quantum probability estimation for device-independent randomness generation in the CHSH Bell-test configuration, and we show significant improvements in finite-data efficiency, particularly at small Bell violations which are typical in current photonic loophole-free Bell tests.

Highlights

  • Randomness is important for many applications including Monte Carlo simulations, statistical sampling, randomized algorithms, and cryptography [1]

  • If a finite sequence of trial results CZ). Then log2(F (CZ) is explainable by local realism and F (CZ) is a quantum estimation factors (QEFs) with power β for the experiment, according to Ref. [36] the event in the statement of theorem 2 would happen with probability at most qβ

  • The finite-data efficiency is an important factor for practical applications of device-independent randomness generation (DIRG)

Read more

Summary

INTRODUCTION

Randomness is important for many applications including Monte Carlo simulations, statistical sampling, randomized algorithms, and cryptography [1]. Due to the lack of finite-data efficiency, even the most advanced DIRG protocol with respect to quantum side information [13] requires a very large number of trials with current loophole-free Bell tests. We develop quantum probability estimation, which enables a full security analysis of DIRG with respect to quantum side information, and most importantly, yields protocols with unsurpassed finite-data efficiency.

NOTATION
QUANTUM ESTIMATION FACTORS
QUANTUM SMOOTH CONDITIONAL MIN-ENTROPY
QUANTUM RANDOMNESS GENERATION
Quantum-proof strong extractors
Protocol soundness
QEF-based randomness-generation protocol
CONSTRUCTION OF MODELS
General models
Models for input-conditional randomness generation
CONSTRUCTION OF QEFS
Properties of QEFs
QEF chaining
QEF optimization
VIII. QEFS FOR THE CHSH BELL-TEST
Finite-data performance of QEFs
Findings
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.