2021
DOI: 10.1038/s41467-020-20018-1
|View full text |Cite
|
Sign up to set email alerts
|

Computing conditional entropies for quantum correlations

Abstract: The rates of quantum cryptographic protocols are usually expressed in terms of a conditional entropy minimized over a certain set of quantum states. In particular, in the device-independent setting, the minimization is over all the quantum states jointly held by the adversary and the parties that are consistent with the statistics that are seen by the parties. Here, we introduce a method to approximate such entropic quantities. Applied to the setting of device-independent randomness generation and quantum key … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

2
54
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 38 publications
(56 citation statements)
references
References 41 publications
(80 reference statements)
2
54
0
Order By: Relevance
“…It is likely that our entropy bound gives suboptimal results in the latter case. This is partly confirmed by a recent result for partially-entangled qubits in [14], where a threshold of about 84.3% is obtained for the global detection efficiency without using noise preprocessing, which is somewhat better than the thresholds of around 86.5% that we obtained for this case here.…”
Section: Discussionsupporting
confidence: 90%
See 1 more Smart Citation
“…It is likely that our entropy bound gives suboptimal results in the latter case. This is partly confirmed by a recent result for partially-entangled qubits in [14], where a threshold of about 84.3% is obtained for the global detection efficiency without using noise preprocessing, which is somewhat better than the thresholds of around 86.5% that we obtained for this case here.…”
Section: Discussionsupporting
confidence: 90%
“…A first motivation for considering these generalisations is purely theoretical. While we now understand how the security of a generic DIQKD protocol can be reduced to computing bounds on the conditional von Neumann entropy (or more precisely the derivation of what the authors of [7] call min-tradeoff functions), obtaining tight or reasonably good bounds beyond the already solved case of the CHSH expression, the simplest Bell expression, is challenging [11][12][13][14]. Our work shows how the von Neumann entropy can be computed for a new class of protocols and our approach, which partly relies on reducing the problem to the well-known BB84 protocol [15], might inspire further, more general, results.…”
Section: Introductionmentioning
confidence: 99%
“…Al-though researchers have closed the detection loopholes in recent experiments with efficiency η ∼ 80% [12][13][14][15][16][17][18][19][20][21][22][23][24], a much higher efficiency, e.g., η > 90%, is normally required for the purpose of device-independent QKD [7][8][9][10][11]. Despite recent theory progress [26,27,[40][41][42][43][44][45][46], a practical implementation of device-independent QKD remains elusive.…”
mentioning
confidence: 99%
“…Nevertheless, for the purpose of device-independent QKD, a much higher efficiency, e.g., η > 90%, is required with the conventional security proofs [17,[21][22][23][24], which is far beyond the current technologies. To lower the threshold efficiency, recent works have proposed different approaches, such as efficient post-processing [31], two-way classical communication [32], noisy preprocessing [33], generalized Bell inequalities [34][35][36], complete statistics via von Neumann entropy [37,38] and multiple key-generation basis [39].…”
mentioning
confidence: 99%