Every quantum key distribution (QKD) protocol must limit the information available outside the users' laboratories. In device-independent QKD this is essentially the only assumption made on the devices. In a prepare-and-measure setting it cannot be imposed strictly, since the sender's device must emit a signal that depends on her private input. The natural replacement, and a minimal one, is a leakage bound: a bound on how much information about the input leaves the sender's laboratory, through the intended signal or through any side channel. We ask how far this unavoidable requirement can replace a detailed model of the source. We show that this single bound, quantified by the probability of guessing the input from everything the source emits, suffices to prove security against collective attacks. In our analysis, nothing is assumed about the precise form of the emitted states, their dimension, energy or purity, nor about the receiver's measurement device, beyond the standard requirement that it does not leak Bob's data. The standard B92 and BB84 protocols do not certify any key under this minimal leakage bound assumption. But closely related protocols can and, in the ideal limit, achieve one secret bit per key round. For noisy implementations, we compute key rates using semidefinite programming relaxations. Our best protocols tolerate visibilities down to 0.84, corresponding to an 8% quantum bit error rate, compared with the 11% threshold of standard device-dependent BB84.
AI Summary
Can a bound on total source leakage replace detailed source characterisation in prepare-and-measure QKD? This paper assumes $P_{\mathrm{guess}}(X|QE_0)\leq G/n$ for $n$ uniformly sampled inputs, including all emitted side channels and Eve’s prior correlations. Apart from standard laboratory-security assumptions, the emitted states have unrestricted dimension and may be mixed, while Bob’s receiver is uncharacterised.
Under this assumption, behaviours reproducible by classical communication with the same leakage certify no key. This excludes every two-preparation protocol, including B92, and standard matched-basis BB84 and six-state statistics. Four related qubit protocols with three, four or six preparations instead use tilted or non-mutually-unbiased measurements. At the honest bound $G=2$, each certifies exactly one secret bit per key round in the ideal limit, proved through a virtual entanglement-based construction and self-testing.
For noisy statistics, conditional von Neumann entropy is lower-bounded by combining a variational relative-entropy bound with semidefinite moment relaxations. A reduction retains only moments linear in the preparation states without weakening the corresponding dual bounds. The best certified visibility threshold is $v_c=0.838$, approximately $8.1\%$ QBER; the lowest detection-efficiency threshold is $\eta_c=0.764$. Several rates numerically match device-independent entanglement-based counterparts.
Security is asymptotic and restricted to collective attacks. Finite-key and coherent-attack extensions require a sequential leakage formulation. The leakage bound must be justified by trusted physical characterisation, not observed statistics; side-channel corrections can scale as $n\sqrt\epsilon$. High required transmission limits practical distances, and convergence of the moment hierarchy is not claimed.
No sign of AI-generated textAI use disclosed
AI tools were used in later stages to improve the manuscript, to write code for additional numerical examples and for the figures, and to explore how the leakage bound can be certified in practice
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Every quantum key distribution (QKD) protocol must limit the information available outside the users' laboratories. In device-independent QKD this is essentially the only assumption made on the devices. In a prepare-and-measure setting it cannot be imposed strictly, since the sender's device must emit a signal that depends on her private input. The natural replacement, and a minimal one, is a leakage bound: a bound on how much information about the input leaves the sender's laboratory, through the intended signal or through any side channel. We ask how far this unavoidable requirement can replace a detailed model of the source. We show that this single bound, quantified by the probability of guessing the input from everything the source emits, suffices to prove security against collective attacks. In our analysis, nothing is assumed about the precise form of the emitted states, their dimension, energy or purity, nor about the receiver's measurement device, beyond the standard requirement that it does not leak Bob's data. The standard B92 and BB84 protocols do not certify any key under this minimal leakage bound assumption. But closely related protocols can and, in the ideal limit, achieve one secret bit per key round. For noisy implementations, we compute key rates using semidefinite programming relaxations. Our best protocols tolerate visibilities down to 0.84, corresponding to an 8% quantum bit error rate, compared with the 11% threshold of standard device-dependent BB84.
Can a bound on total source leakage replace detailed source characterisation in prepare-and-measure QKD? This paper assumes Pguess(X∣QE0)≤G/n for n uniformly sampled inputs, including all emitted side channels and Eve’s prior correlations. Apart from standard laboratory-security assumptions, the emitted states have unrestricted dimension and may be mixed, while Bob’s receiver is uncharacterised.
Under this assumption, behaviours reproducible by classical communication with the same leakage certify no key. This excludes every two-preparation protocol, including B92, and standard matched-basis BB84 and six-state statistics. Four related qubit protocols with three, four or six preparations instead use tilted or non-mutually-unbiased measurements. At the honest bound G=2, each certifies exactly one secret bit per key round in the ideal limit, proved through a virtual entanglement-based construction and self-testing.
For noisy statistics, conditional von Neumann entropy is lower-bounded by combining a variational relative-entropy bound with semidefinite moment relaxations. A reduction retains only moments linear in the preparation states without weakening the corresponding dual bounds. The best certified visibility threshold is vc=0.838, approximately 8.1% QBER; the lowest detection-efficiency threshold is ηc=0.764. Several rates numerically match device-independent entanglement-based counterparts.
Security is asymptotic and restricted to collective attacks. Finite-key and coherent-attack extensions require a sequential leakage formulation. The leakage bound must be justified by trusted physical characterisation, not observed statistics; side-channel corrections can scale as nϵ. High required transmission limits practical distances, and convergence of the moment hierarchy is not claimed.
Semi-device-independent quantum key distribution leaves the measurement devices uncharacterized while placing a trusted assumption on Alice's source. We formulate this source assumption operationally on Alice's four-preparation ensemble as a scalar bound on one of four physically motivated source tasks: full-label guessing, parity guessing, or their normalized composites with label exclusion. For the two-bit random-access code, we derive the exact classical frontier for each of the four source assumptions. Numerically, the BB84 strategy attains the maximal quantum deviation from all four frontiers, while the preparation-depolarized BB84 family and the direct-sum label-leakage family trace complementary branches of the arbitrary-dimensional quantum boundary for the two exclusion-assisted assumptions. Because all four task values are monotone under input-independent quantum channels, the same scalar source bound constrains every Bob--Eve extension compatible with the complete observed behavior. Using a three-setting extension that separates RAC testing from key generation, we obtain two dimension-independent security certificates over this feasible set: lower bounds on the conditional min-entropy and conditional von Neumann entropy, obtained respectively by direct optimization of Eve's key-guessing probability and by prepare-and-measure semidefinite relaxations based on the Brown--Fawzi--Fawzi variational bound. The exclusion-assisted assumptions certify positive key rates down to nearly vanishing preparation visibility, far beyond full-label or parity guessing alone. Under direct-sum label leakage, all four independently optimized rate bounds remain positive at every sampled incomplete-leakage point and vanish only at complete label revelation. These results show that robust semi-device-independent security depends not only on what Eve can identify, but also on what she can exclude.
There is a large gap between theory and practice in quantum key distribution (QKD) because real devices do not satisfy the assumptions required by the security proofs. Here, we close this gap by introducing a simple and practical measurement-device-independent-QKD type of protocol, based on the transmission of coherent light, for which we prove its security against any possible imperfection and/or side channel from the quantum communication part of the QKD devices. Our approach only requires to experimentally characterize an upper bound of one single parameter for each of the pulses sent, which describes the quality of the source. Moreover, unlike device-independent (DI) QKD, it can accommodate information leakage from the users' laboratories, which is essential to guarantee the security of QKD implementations. In this sense, its security goes beyond that provided by DI QKD, yet it delivers a secret key rate that is various orders of magnitude greater than that of DI QKD.
Abstract Most security proofs of quantum key distribution (QKD) assume that there is no unwanted information leakage about the state preparation process. However, this assumption is impossible to guarantee in practice, as QKD systems can leak information to the channel due to device imperfections or the active action of an eavesdropper. Here, we solve this pressing issue by introducing a security proof in the presence of information leakage from all state preparation settings for arguably the most popular QKD scheme, namely the decoy-state BB84 protocol. The proof requires minimal experimental characterization, as only a single parameter related to the isolation of the source needs to be determined, thus providing a clear path for bridging the gap between theory and practice. Moreover, if information about the state of the side channels is available, this can be readily incorporated into the analysis to further improve the resulting performance.
Quantum key distribution protocols have been studied for almost four decades, and have already seen real world applications. Such implementations often operate in naturally noisy environments (e.g., sensor thermal noise, sun radiation, etc.) with known or measurable noise levels. However, existing security proofs implicitly attribute any channel noise to a possible eavesdropper, an overly pessimistic assumption that can adversely effect the guaranteed protocol key-rate. In this paper, we analyze general prepare-and-measure QKD schemes, and show how to improve the bounds on the key-rate under the assumption of an independent state replacement noise at the receiver. Taking BB84 as a concrete example, our results theoretically guarantee a higher key-rate, as a function of the minimal possible replacement probability. In practice, for some parameter-regimes, this guarantees a higher tolerable QBER.
We provide an analysis of a family of device-independent quantum key distribution (QKD) protocols that has the following features. (a) The bits used for the secret key do not come from the results of the measurements on an entangled state but from the choices of settings. (b) Instead of a single security parameter (a violation of some Bell inequality) a set of them is used to estimate the level of trust in the secrecy of the key. The main advantage of these protocols is a smaller vulnerability to imperfect random number generators made possible by feature (a). We prove the security and the robustness of such protocols. We show that using our method it is possible to construct a QKD protocol which retains its security even if the source of randomness used by communicating parties is strongly biased. As a proof of principle, an explicit example of a protocol based on the Hardy's paradox is presented. Moreover, in the noiseless case, the protocol is secure in a natural way against any type of memory attack, and thus allows one to reuse the device in subsequent rounds. We also analyze the robustness of the protocol using semidefinite programming methods. Finally, we present a postprocessing method, and observe a paradoxical property that rejecting some random part of the private data can increase the key rate of the protocol.
This report reviews two quantum key distribution (QKD) protocols: the BB84 protocol and the measurement device independent (MDI) QKD protocol. The goal of this report is to recreate the security proof of the BB84 protocol, to generate the secret key rate for a practical application of the BB84 protocol, both with and without decoy states, and to review the MDI-QKD protocol and look at the advantages it has for practical QKD. The proof security of the BB84 protocol is done by designing an equivalent theoretical protocol and proving its security by bounding the information of the eavesdropper to an exponentially small number. The best distance over which secret key rate can be generated with the practical model of the BB84 protocol that is presented in this report, is 165 km. This is achieved by employing decoy states and is more than three times as far as the model can achieve without decoy states, which gave a distance of 52 km at best. The zero distance key rate of the model with decoy states is R = 1.21 · 10-2 bits per pulse (bpp), at best. This is an order of magnitude larger than R =1.02 · 10-3 bpp, which is what the model without decoy states could produce. The decoy state method is therefore an improvement for practical QKD. By reviewing the MDI-QKD protocol it can be concluded that because it eliminates the measurement device side channels, it is very useful for practical QKD, since it makes security analysis simpler and more precise. It also necessarily employs decoy states, which improves the secret key rate. MDI-QKD therefore is a promising protocol to use for future quantum communications.