REVIEW 3 cited by
Entropy accumulation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We ask the question whether entropy accumulates, in the sense that the operationally relevant total uncertainty about an $n$-partite system $A = (A_1, \ldots A_n)$ corresponds to the sum of the entropies of its parts $A_i$. The Asymptotic Equipartition Property implies that this is indeed the case to first order in $n$, under the assumption that the parts $A_i$ are identical and independent of each other. Here we show that entropy accumulation occurs more generally, i.e., without an independence assumption, provided one quantifies the uncertainty about the individual systems $A_i$ by the von Neumann entropy of suitably chosen conditional states. The analysis of a large system can hence be reduced to the study of its parts. This is relevant for applications. In device-independent cryptography, for instance, the approach yields essentially optimal security bounds valid for general attacks, as shown by Arnon-Friedman et al.
Forward citations
Cited by 3 Pith papers
-
Computing secure key rates for quantum key distribution with untrusted devices
This paper derives an SDP-based lower bound on the von Neumann entropy for device-independent QKD, enabling key-rate computations for arbitrary protocols via the NPA hierarchy.
-
Quantum key distribution with correlated sources
Security proofs for QKD can be extended to arbitrary long-range pulse correlations by treating the correlated source as an independent source with additional side-channels, and a new reference technique improves the r...
-
Topological State-Aware Simulation Framework for Inter-Satellite Twin-Field QKD Networks
A satellite twin-field QKD simulation with a topological data-analysis gate shows no rate advantage over the same gate without TDA, and the authors state the full composable-security proof remains incomplete.
Discussion (0). Continue with ORCID to comment.