Abstract

The Entropy Accumulation Theorem (EAT) was introduced to significantly improve the finite-size rates for device-independent quantum information processing tasks such as device-independent quantum key distribution (QKD). A natural question would be whether it also improves the rates for device-dependent QKD. In this work, we provide an affirmative answer to this question. We present new tools for applying the EAT in the device-dependent setting. We present sufficient conditions for the Markov chain conditions to hold as well as general algorithms for constructing the needed min-tradeoff function. Utilizing Dupuis' recent privacy amplification without smoothing result, we improve the key rate by optimizing the sandwiched Rényi entropy directly rather than considering the traditional smooth min-entropy. We exemplify these new tools by considering several examples including the BB84 protocol with the qubit-based version and with a realistic parametric down-conversion source, the six-state four-state protocol and a high-dimensional analog of the BB84 protocol.

Keywords

Quantum key distributionBB84Computer scienceEntropy (arrow of time)Key (lock)SmoothingMarkov chainQubitTheoretical computer scienceQuantumProtocol (science)Quantum cryptographyStatistical physicsQuantum informationQuantum mechanicsPhysicsComputer security

Related Publications

Publication Info

Year
2025
Type
article
Volume
9
Pages
1941-1941
Citations
4
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

4
OpenAlex

Cite This

I. M. George, Thomas van Himbeeck, Kun Fang et al. (2025). Finite-Key Analysis of Quantum Key Distribution with Characterized Devices Using Entropy Accumulation. Quantum , 9 , 1941-1941. https://doi.org/10.22331/q-2025-12-12-1941

Identifiers

DOI
10.22331/q-2025-12-12-1941