One-Shot Min-Entropy Calculation Of Classical-Quantum States And Its Application To Quantum Cryptography

Abstract

In quantum Shannon theory, various kinds of quantum entropies are used to characterize the capacities of noisy physical systems. Among them, min-entropy and its smooth version attract wide interest especially in the field of quantum cryptography as they can be used to bound the information obtained by an adversary. However, calculating the exact value or non-trivial bounds of min-entropy are extremely difficult because the composite system dimension may scale exponentially with the dimension of its subsystem. Here, we develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state that is applicable to both finite and infinite dimensional reduced quantum states. Moreover, we show our technique is of practical interest in at least three situations. First, it offers an alternative tight finite-data analysis for the BB84 quantum key distribution scheme. Second, it gives the best finite-key bound known to date for a variant of device independent quantum key distribution protocol. Third, it provides a security proof for a novel source-independent continuous-variable quantum random number generation protocol. These results show the effectiveness and wide applicability of our approach.

References in corpus (26)

• Device-independent security of quantum cryptography against collective attacks
• Quantum Random Number Generators
• On quantum Renyi entropies: a new generalization and some properties
• The operational meaning of min- and max-entropy
• Entropic Uncertainty Relations and their Applications
• Tight Finite-Key Analysis for Quantum Cryptography
• Device-independent quantum key distribution secure against collective attacks
• The Uncertainty Relation for Smooth Entropies
• Quantum random number generation
• 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
• Symmetry implies independence
• Leftover Hashing Against Quantum Side Information
• A Fully Quantum Asymptotic Equipartition Property
• Duality Between Smooth Min- and Max-Entropies
• Quantum Randomness Certified by the Uncertainty Principle
• Memory Attacks on Device-Independent Quantum Cryptography
• Source-device-independent Ultra-fast Quantum Random Number Generation
• Secure heterodyne-based quantum random number generator at 17 Gbps
• Source-independent quantum random number generation
• A largely self-contained and complete security proof for quantum key distribution
• Entropy accumulation
• Composability in quantum cryptography
• Min- and Max-Entropy in Infinite Dimensions
• Tight finite-key analysis for generalized high-dimensional quantum key distribution