Generalized Rényi entropy accumulation theorem and generalized quantum probability estimation
arXiv:2405.05912 · doi:10.1103/pgrn-mz9j
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ényi entropies if desired, yielding fully-Rényi security proofs. Our proof techniques are based on elaborating on a connection between entropy accumulation and the frameworks of quantum probability estimation or -weighted Rényi 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.
arXiv commentClose to published version, with more explanations below Theorem 4.1. Changelog: significant restructuring; some lemmas renumbered/added; statements improved/simplified; removed parts superceded by arXiv:2502.01611 & arXiv:2502.02563; renamed QES-entropies to align with prior work; addressed error regarding rate-bounding channels in [v3]-[v4] by defining a "convex range"; fixed Sec. 5.2.1 typos
References in corpus (35)
- Measurement-device-independent quantum key distribution
- Random Numbers Certified by Bell's Theorem
- The Uncertainty Principle in the Presence of Quantum Memory
- On quantum Renyi entropies: a new generalization and some properties
- An information-theoretic security proof for QKD protocols
- Min- and Max- Relative Entropies and a New Entanglement Monotone
- Security in Quantum Cryptography
- Secure device-independent quantum key distribution with causally independent measurement devices
- Post-selection technique for quantum channels with applications to quantum cryptography
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- Sandwiched Rényi Divergence Satisfies Data Processing Inequality
- Monotonicity of a relative Rényi entropy
- Quantum hypothesis testing and the operational interpretation of the quantum Renyi relative entropies
- Security of practical private randomness generation
- Simple security analysis of phase-matching measurement-device-independent quantum key distribution
- Simple and tight device-independent security proofs
- Device-independent randomness expansion against quantum side information
- A largely self-contained and complete security proof for quantum key distribution
- Reliable numerical key rates for quantum key distribution
- Entropy accumulation
- Symmetries in Quantum Key Distribution and the Connection between Optimal Attacks and Optimal Cloning
- Relating different quantum generalizations of the conditional Renyi entropy
- On Variational Expressions for Quantum Relative Entropies
- Entropy accumulation with improved second-order term
- Security analysis of quantum key distribution with small block length and its application to quantum space communications
- Security of quantum key distribution from generalised entropy accumulation
- Towards a realization of device-independent quantum key distribution
- Parallel Device-Independent Quantum Key Distribution
- Generalised entropy accumulation
- Security of discrete-modulated continuous-variable quantum key distribution
- Chain rules for quantum Rényi entropies
- Device-independent Certification of One-shot Distillable Entanglement
- Security Proof for Variable-Length Quantum Key Distribution
- Postselection technique for optical Quantum Key Distribution with improved de Finetti reductions
- Device independent security of quantum key distribution from monogamy-of-entanglement games