Finite-size analysis of prepare-and-measure and decoy-state QKD via entropy accumulation

Abstract

An important goal in quantum key distribution (QKD) is the task of providing a finite-size security proof without the assumption of collective attacks. For prepare-and-measure QKD, one approach for obtaining such proofs is the generalized entropy accumulation theorem (GEAT), but thus far it has only been applied to study a small selection of protocols. In this work, we present techniques for applying the GEAT in finite-size analysis of generic prepare-and-measure protocols, with a focus on decoy-state protocols. In particular, we present an improved approach for computing entropy bounds for decoy-state protocols, which has the dual benefits of providing tighter bounds than previous approaches (even asymptotically) and being compatible with methods for computing min-tradeoff functions in the GEAT. Furthermore, we develop methods to incorporate some improvements to the finite-size terms in the GEAT, and implement techniques to automatically optimize the min-tradeoff function. Our approach also addresses some numerical stability challenges specific to prepare-and-measure protocols, which were not addressed in previous works.

Final PRX Quantum version which added more comparisons with entropic uncertainty relations. The code used to prepare the results in this paper is available at https://openqkdsecurity.wordpress.com/repositories-for-publications/

References in corpus (9)

• Post-selection technique for quantum channels with applications to quantum cryptography
• Squashing Models for Optical Measurements in Quantum Communication
• Security of quantum key distribution from generalised entropy accumulation
• Generalised entropy accumulation
• Security of discrete-modulated continuous-variable quantum key distribution
• Imperfect Phase-Randomisation and Generalised Decoy-State Quantum Key Distribution
• Postselection technique for optical Quantum Key Distribution with improved de Finetti reductions
• Security Proof for Variable-Length Quantum Key Distribution
• Improved Decoy-state and Flag-state Squashing Methods

Cited by in corpus (5)

• A consolidated and accessible security proof for finite-size decoy-state quantum key distribution
• Imperfect detectors for adversarial tasks with applications to quantum key distribution
• Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs
• Sequential Semi-Device-Independent Quantum Randomness Certification
• Finite-size secret-key rates of discrete modulation continuous-variable quantum key distribution under Gaussian attacks