اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTime-cost analysis of a quantum key distribution system clocked at 100 MHz
166
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We describe the realization of a quantum key distribution (QKD) system clocked at 100 MHz. The system includes classical postprocessing implemented via software, and is operated over a 12 km standard telecommunication dark fiber in a real-world environment. A time-cost analysis of the sifted, error-corrected, and secret key rates relative to the raw key rate is presented, and the scalability of our implementation with respect to higher secret key rates is discussed.
قيم البحث
اقرأ أيضاً
We experimentally realize a measurement-device-independent quantum key distribution (MDI-QKD) system based on cost-effective and commercially available hardware such as distributed feedback (DFB) lasers and field-programmable gate arrays (FPGA) that
enable time-bin qubit preparation and time-tagging, and active feedback systems that allow for compensation of time-varying properties of photons after transmission through deployed fibre. We examine the performance of our system, and conclude that its design does not compromise performance. Our demonstration paves the way for MDI-QKD-based quantum networks in star-type topology that extend over more than 100 km distance.
We report on an integrated photonic transmitter of up to 100 MHz repetition rate, which emits pulses centered at 850 nm with arbitrary amplitude and polarization. The source is suitable for free space quantum key distribution applications. The whole
transmitter, with the optical and electronic components integrated, has reduced size and power consumption. In addition, the optoelectronic components forming the transmitter can be space-qualified, making it suitable for satellite and future space missions.
We report the security analysis of time-coding quantum key distribution protocols. The protocols make use of coherent single-photon pulses. The key is encoded in the photon time-detection. The use of coherent superposition of states allows to detect
eavesdropping of the key. We give a mathematical model of a first protocol from which we derive a second, simpler, protocol. We derive the security analysis of both protocols and find that the secure rates can be similar to those obtained with the BB84 protocol. We then calculate the secure distance for those protocols over standard fibre links. When using low-noise superconducting single photon detectors, secure distances over 200 km can be foreseen. Finally, we analyse the consequences of photon-number splitting attacks when faint pulses are used instead of single photon pulses. A decoy states technique can be used to prevent such attacks.
Quantum key distribution (QKD), a technology that enables perfectly secure communication, has evolved to the stage where many different protocols are being used in real-world implementations. Each protocol has its own advantages, meaning that users c
an choose the one best-suited to their application, however each often requires different hardware. This complicates multi-user networks, in which users may need multiple transmitters to communicate with one another. Here, we demonstrate a direct-modulation based transmitter that can be used to implement most weak coherent pulse based QKD protocols with simple changes to the driving signals. This also has the potential to extend to classical communications, providing a low chirp transmitter with simple driving requirements that combines phase shift keying with amplitude shift keying. We perform QKD with concurrent time-bin and phase modulation, alongside phase randomisation. The acquired data is used to evaluate secure key rates for time-bin encoded BB84 with decoy states and a finite key-size analysis, giving megabit per second secure key rates, 1.60 times higher than if purely phase-encoded BB84 was used.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
