This work presents a security proof for generic prepare-and-measure QKD protocols, including decoy-state BB84, with imperfect and imperfectly characterized sources and detectors using the marginal-constrained entropy accumulation theorem (MEAT).
Abstract
Practical quantum key distribution (QKD) systems inevitably exhibit imperfections in both the source and detector. At the same time, the behavior of these imperfect devices is never exactly known due to characterization uncertainty, parameter fluctuations, and potential influence by an adversary. In this work, we present a security proof for generic prepare-and-measure QKD protocols, including decoy-state BB84, with imperfect and imperfectly characterized sources and detectors using the marginal-constrained entropy accumulation theorem (MEAT). Our approach uses a sequence of proof technique independent source maps and squashing maps, yielding a very modular framework. We show that practical key rates can be achieved even when multiple imperfections are combined. More broadly, our work provides a unified foundation that avoids the need for dedicated protocol-specific arguments and can be readily extended to other protocols and device imperfections.
Bell nonlocality allows secret key to be certified without trusting the internal operation of the devices, and even against eavesdroppers constrained only by the no-signaling principle. We ask whether generalized contextuality, a notion of nonclassicality available in prepare-and-measure experiments on a single system,...
Daniel Centeno, Roberto D. Baldijão, Maria Ciudad Alan'on et al.· 0 citations
Practical QKD modulators introduce correlations between consecutively emitted pulses due to bandwidth limitations, violating key assumptions underlying many security proof techniques. Here, we address this problem by introducing a simple yet powerful mathematical framework to directly extend phase-error-estimation-base...
It is shown that general post-selective soft-filtering transformations of side-channel states can be consistently incorporated into the GLLP and Koashi framework, and a Holevo-based upper bound on the eavesdropper's information for decoy-state BB84 is derived.
I. Sushchev, Kirill Bugai, D. Bulavkin et al.· AVS Quantum Science· 0 citations
We study quantum-state oblivious transfer over the quantum erasure channel under information-theoretic security guarantees. Specifically, Alice holds two quantum systems, Bob wishes to recover one of them, and the parties have access to independent channel uses and authenticated public classical communication, with no...
The amount of secret key that can be obtained from a quantum key distribution run depends on both the physically observed error rates and the mathematical bounds used to certify security. For finite datasets, conservative bounds force users to discard a substantial fraction of the potentially available key. Here we fur...
M. Tan, Bartosz Regula, Marco Tomamichel· 0 citations
This work analyzes the robustness of multi‐dimensional quantum secret sharing schemes under four different noise models, namely amplitude damping (ad), depolarizing (d), dit flip (df), and d$d$ phase flip (dpf).
