Marginal-constrained entropy accumulation theorem
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YRUCRXUQrecord.jsonopen to challenge →
read the original abstract
We derive a novel chain rule for a family of channel conditional entropies, covering von Neumann and sandwiched R\'{e}nyi entropies. In the process, we show that these channel conditional entropies are equal to their regularized version, and more generally, additive across tensor products of channels. For the purposes of cryptography, applying our chain rule to sequences of channels yields a new variant of R\'{e}nyi entropy accumulation, in which we can impose some specific forms of marginal-state constraint on the input states to each individual channel. This generalizes a recently introduced security proof technique that was developed to analyze prepare-and-measure QKD with no limitations on the repetition rate. In particular, our generalization yields ``fully adaptive'' protocols that can in principle update the entropy estimation procedure during the protocol itself, similar to the quantum probability estimation framework.
This paper has not been read by Pith yet.
Forward citations
Cited by 6 Pith papers
-
Security of decoy-state quantum key distribution with correlated bit-and-basis encoders
A finite-key security proof for decoy-state BB84 against coherent attacks that incorporates correlations from Alice's encoder with only partial characterization.
-
Rigorous Security Proofs for Practical Quantum Key Distribution
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
-
Finite-size quantum key distribution rates from R\'enyi entropies using conic optimization
A general conic optimization solver computes finite-size QKD rates from Rényi entropies more reliably than prior Frank-Wolfe methods.
-
Effective discrete-modulated continuous variable QKD under general attacks
Finite-size security proof for discrete-modulated CV-QKD under general attacks using dimension reduction and entropy accumulation yields positive rates at block sizes of order 10^8.
-
Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs
Overview of recent analytical and numerical advances in security proofs for QKD protocols that incorporate device imperfections to bridge theory and practice.
-
Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs
Overview of recent analytical and numerical developments in QKD security proofs that incorporate imperfections to re-establish security under realistic conditions.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.