2018
DOI: 10.22331/q-2018-08-22-86
|View full text |Cite
|
Sign up to set email alerts
|

Device-independent randomness generation with sublinear shared quantum resources

Abstract: In quantum cryptography, deviceindependent (DI) protocols can be certified secure without requiring assumptions about the inner workings of the devices used to perform the protocol. In order to display nonlocality, which is an essential feature in DI protocols, the device must consist of at least two separate components sharing entanglement. This raises a fundamental question: how much entanglement is needed to run such DI protocols? We present a two-device protocol for DI random number generation (DIRNG) whic… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
2

Relationship

1
9

Authors

Journals

citations
Cited by 18 publications
(10 citation statements)
references
References 30 publications
0
9
0
Order By: Relevance
“…The results on self-testing properties of binary XOR games from [MS13] were expanded in [MS16] and used to devise protocols for exponential randomness expansion. More recently, the authors of [BMP18] directly use robust selftesting bounds for the tilted-CHSH inequality [BP15] to lower bound the randomness generated in their protocol. Self-testing techniques are also used in [APVW16, ABDC18, WKB + 19] to prove that two bits of local randomness can be certified from a two-qubit entangled state.…”
Section: Device-independent Randomness Generationmentioning
confidence: 99%
“…The results on self-testing properties of binary XOR games from [MS13] were expanded in [MS16] and used to devise protocols for exponential randomness expansion. More recently, the authors of [BMP18] directly use robust selftesting bounds for the tilted-CHSH inequality [BP15] to lower bound the randomness generated in their protocol. Self-testing techniques are also used in [APVW16, ABDC18, WKB + 19] to prove that two bits of local randomness can be certified from a two-qubit entangled state.…”
Section: Device-independent Randomness Generationmentioning
confidence: 99%
“…For instance, the tilted CHSH inequalities introduced in [41], though weaker than the CHSH inequality for detecting non-classicality, are useful for other purposes. In a device-independent setting, they enable certifying more randomness that would be possible using standard CHSH [41,42].…”
Section: General Mapping Between Bell and Instrumental Inequalities Imentioning
confidence: 99%
“…An important property of Bell inequalities is that any violation implies true randomness [16,47]. In our case, A 1 B 1 reaches the maximal algebraic violation of CHSH, which implies that A 1 (and also B 1 ) is totally unpredictable.…”
mentioning
confidence: 72%