اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFinite-key analysis for a practical decoy-state twin-field quantum key distribution
124
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Twin-field quantum key distribution (TF-QKD), which is immune to all possible detector side channel attacks, enables two remote legitimate users to perform secure communications without quantum repeaters. With the help of a central node, TF-QKD is expected to overcome the linear key-rate constraint using current technologies. However, the security of the former TF-QKD protocols relies on the hypothesis of infinite-key and stable sources. In this paper, we present the finite-key analysis of a practical decoy-state twin-field quantum key distribution with variant statistical fluctuation models. We examine the composable security of the protocol with intensity fluctuations of unstable sources employing Azumas inequality. Our simulation results indicate that the secret key rate is able to surpass the linear key-rate bound with limited signal pulses and intensity fluctuations. In addition, the effect of intensity fluctuations is extremely significant for small size of total signals.
قيم البحث
اقرأ أيضاً
Twin-Field quantum key distribution (TF-QKD) and its variants, e.g. Phase-Matching QKD, Sending-or-not-sending QKD, and No Phase Post-Selection TFQKD promise high key rates at long distance to beat the rate distance limit without a repeater. The secu
rity proof of these protocols are based on decoy-state method, which is usually performed by actively modulating a variable optical attenuator together with a random number generator in practical experiments, however, active-decoy schemes like this may lead to side channel and could open a security loophole. To enhance the source security of TF-QKD, in this paper, we propose passive-decoy based TF-QKD, in which we combine TF-QKD with the passive-decoy method. And we present a simulation comparing the key generation rate with that in active-decoy, the result shows our scheme performs as good as active decoy TF-QKD, and our scheme could reach satisfactory secret key rates with just a few photon detectors. This shows our work is meaningful in practice.
The lists of bits processed in quantum key distribution are necessarily of finite length. The need for finite-key unconditional security bounds has been recognized long ago, but the theoretical tools have become available only very recently. We provi
de finite-key unconditional security bounds for two practical implementations of the Bennett-Brassard 1984 coding: prepare-and-measure implementations without decoy states, and entanglement-based implementations. A finite-key bound for prepare-and-measure implementations with decoy states is also derived under a simplified treatment of the statistical fluctuations. The presentation is tailored to allow direct application of the bounds in experiments. Finally, the bounds are also evaluated on a priori reasonable expected values of the observed parameters.
Twin-Field Quantum Key Distribution(TF-QKD) protocol and its variants, such as Phase-Matching QKD(PM-QKD), sending or not QKD(SNS-QKD) and No Phase Post-Selection TF-QKD(NPP-TFQKD), are very promising for long-distance applications. However, there ar
e still some gaps between theory and practice in these protocols. Concretely, a finite-key size analysis is still missing, and the intensity fluctuations are not taken into account. To address the finite-key size effect, we first give the key rate of NPP-TFQKD against collective attack in finite-key size region and then prove it can be against coherent attack. To deal with the intensity fluctuations, we present an analytical formula of 4-intensity decoy state NPP-TFQKD and a practical intensity fluctuation model. Finally, through detailed simulations, we show NPP-TFQKD can still keep its superiority of high key rate and long achievable distance.
Decoy state protocols are a useful tool for many quantum key distribution systems implemented with weak coherent pulses, allowing significantly better secret bit rates and longer maximum distances. In this paper we present a method to numerically fin
d optimal three-level protocols, and we examine how the secret bit rate and the optimized parameters are dependent on various system properties, such as session length, transmission loss, and visibility. Additionally, we show how to modify the decoy state analysis to handle partially distinguishable decoy states as well as uncertainty in the prepared intensities.
Quantum key distribution (QKD) can help two distant peers to share secret key bits, whose security is guaranteed by the law of physics. In practice, the secret key rate of a QKD protocol is always lowered with the increasing of channel distance, whic
h severely limits the applications of QKD. Recently, twin-field (TF) QKD has been proposed and intensively studied, since it can beat the rate-distance limit and greatly increase the achievable distance of QKD. Remarkalebly, K. Maeda et. al. proposed a simple finite-key analysis for TF-QKD based on operator dominance condition. Although they showed that their method is sufficient to beat the rate-distance limit, their operator dominance condition is not general, i.e. it can be only applied in three decoy states scenarios, which implies that its key rate cannot be increased by introducing more decoy states, and also cannot reach the asymptotic bound even in case of preparing infinite decoy states and optical pulses. Here, to bridge this gap, we propose an improved finite-key analysis of TF-QKD through devising new operator dominance condition. We show that by adding the number of decoy states, the secret key rate can be furtherly improved and approach the asymptotic bound. Our theory can be directly used in TF-QKD experiment to obtain higher secret key rate. Our results can be directly used in experiments to obtain higher key rates.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
