Certified Quantum Random Numbers from Untrusted Light

Drahi, David; Walk, Nathan; Hoban, Matty J.; Fedorov, Aleksey K.; Shakhovoy, Roman; Feimov, Akky; Kurochkin, Y. V.; Kolthammer, W. Steven; Nunn, Joshua; Barrett, Jonathan; Walmsley, Ian A.

doi:10.1103/physrevx.10.041048

Cited by 44 publications

(20 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…case (where the X i 's are independent and 12 see e.g. Tucci [366], Teh et al [358], Aghamohammadi & Crutchfield [6], Herrero-Collantes & Garcia-Escartin [159], Balygin et al [31], Dang et al [103], Gong et al [138], Chandrasekaran et al [77], Drahi et al [117], Kollmitzer et al [194], Liu et al [228], Fischer & Gauthier [126], Kim et al [188], Stoller & Campbell [342] 13 a detailed discussion and comparisons are beyond the scope of this paper, given its current length 14 see e.g. Schrijver [324], Bertsimas & Weismantel [45], Chen et al [83], Onn [279], Korte & Vygen [195], Wolsey [393] for comprehensive books on discrete, integer and combinatorial programming and their vast applications 15 notice that P emp n a probability measure on the data space Y, which is random due to its dependence on the X i 's have common distribution P), ergodic Markov chains on Y with stationary distribution P, more globally autoregressive chains with stationary measure P, etc.…”

Section: Minimum Distance/risk Estimationmentioning

confidence: 99%

A precise bare simulation approach to the minimization of some distances. Foundations

Broniatowski¹,

Stummer²

2021

Preprint

View full text Add to dashboard Cite

In information theory -as well as in the adjacent fields of statistics, machine learning, artificial intelligence, signal processing and pattern recognition -many flexibilizations of the omnipresent Kullback-Leibler information distance (relative entropy) and of the closely related Shannon entropy have become frequently used tools. To tackle corresponding constrained minimization (respectively maximization) problems by a newly developed dimension-free bare (pure) simulation method, is the main goal of this paper. Almost no assumptions (like convexity) on the set of constraints are needed, within our discrete setup of arbitrary dimension, and our method is precise (i.e., converges in the limit). As a side effect, we also derive an innovative way of constructing new useful distances/divergences. To illustrate the core of our approach, we present numerous examples. The potential for widespread applicability is indicated, too; in particular, we deliver many recent references for uses of the involved distances/divergences and entropies in various different research fields (which may also serve as an interdisciplinary interface).

show abstract

Section: Minimum Distance/risk Estimationmentioning

confidence: 99%

A precise bare simulation approach to the minimization of some distances. Foundations

Broniatowski¹,

Stummer²

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The most dramatic of these are fully device-independent protocols [41,42], which rely on Bell nonlocality [43] to provide a highly rigorous level of certification but which are extremely experimentally challenging [44,45]. The plethora of intermediate methods that trade practicality for additional assumptions and characterisation are known as semi-device independent [46][47][48][49][50][51][52][53][54][55].…”

Section: Introductionmentioning

confidence: 99%

Experimental demonstration of an efficient, semi-device-independent photonic indistinguishability witness

Meer¹,

Hooijschuur²,

Somhorst³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

Efficient and reliable measurements of photonic indistinguishability are crucial to solidify claims of a quantum advantage in photonics. Existing indistinguishability witnesses may be vulnerable to implementation loopholes, showing the need for a measurement which depends on as few assumptions as possible. Here, we introduce a semi-device-independent witness of photonic indistinguishability and measure it on an integrated photonic processor, certifying three-photon indistinguishability in a way that is insensitive to implementation errors in our processor.

show abstract

“…To date, the rate of the fastest DI-QRNG has been reported to be 181 bps [30], which is very low for practical applications. To increase both the bit rate and security, source independent QRNGs (SI-QRNGs), as a compromise solution, have been proposed [31][32][33][34][35][36]. By a proper conditional min-entropy estimation, SI-QRNGs can generate highspeed secure random numbers with the untrusted source.…”

Section: Introductionmentioning

confidence: 99%

Security Analysis and Improvement of Source Independent Quantum Random Number Generators with Imperfect Devices

Lin,

Wang,

Yin

et al. 2021

Preprint

View full text Add to dashboard Cite

Certified Quantum Random Numbers from Untrusted Light

Cited by 44 publications

References 49 publications

A precise bare simulation approach to the minimization of some distances. Foundations

A precise bare simulation approach to the minimization of some distances. Foundations

Experimental demonstration of an efficient, semi-device-independent photonic indistinguishability witness

Security Analysis and Improvement of Source Independent Quantum Random Number Generators with Imperfect Devices

Contact Info

Product

Resources

About