Generalized R\'enyi entropy accumulation theorem and generalized quantum probability estimation
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:NK6AEVKVrecord.jsonopen to challenge →
read the original abstract
The entropy accumulation theorem, and its subsequent generalized version, is a powerful tool in the security analysis of many device-dependent and device-independent cryptography protocols. However, it has the drawback that the finite-size bounds it yields are not necessarily optimal, and furthermore it relies on the construction of an affine min-tradeoff function, which can often be challenging to construct optimally in practice. In this work, we address both of these challenges simultaneously by deriving a new entropy accumulation bound. Our bound yields significantly better finite-size performance, and can be computed as an intuitively interpretable convex optimization, without any specification of affine min-tradeoff functions. Furthermore, it can be applied directly at the level of R\'enyi entropies if desired, yielding fully-R\'enyi security proofs. Our proof techniques are based on elaborating on a connection between entropy accumulation and the frameworks of quantum probability estimation or $f$-weighted R\'enyi entropies, and in the process we obtain some new results with respect to those frameworks as well. In particular, those findings imply that our bounds apply to prepare-and-measure protocols without the virtual tomography procedures or repetition-rate restrictions previously required for entropy accumulation.
This paper has not been read by Pith yet.
Forward citations
Cited by 8 Pith papers
-
Finite-size general security for relativistic phase shift keying via variable-length quantum key distribution
The paper proves finite-size general security for relativistic phase shift keying (RPSK) achieving secret key rates beyond 12 dB with 10^5 signals via entropy accumulation, Rényi leftover hashing, and conic optimization.
-
Finite-size general security for relativistic phase shift keying via variable-length quantum key distribution
Finite-size general security for DPSK QKD is achieved with positive key rates for 10^5 signals beyond 12 dB loss via variable-length entropy accumulation and conic optimization.
-
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.
-
Asymptotically tight security analysis of quantum key distribution based on universal source compression
A virtual protocol based on universal source compression enables asymptotically tight finite-size security proofs for permutation-symmetrizable QKD by reducing the problem to conditional Rényi entropy estimation.
-
Fully Quantum Computational Entropies
Authors introduce quantum computational min- and max-entropies with properties including data processing and chain rules, plus an operational link to bounded-circuit entanglement distillation.
-
Generalized Numerical Framework for Improved Finite-Sized Key Rates with R\'enyi Entropy
Authors provide analytical bound and gradient for Rényi quantities to extend numerical QKD finite-key optimization, reporting gains in high-loss low-block regimes.
-
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.