اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA frequency-coded QKD scheme with an extension to qu-quarts
99
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose a novel scheme to implement the BB84 quantum key distribution (QKD) protocol in optical fibers based on a quantum frequency-translation (QFT) process. Unlike conventional QKD systems, which rely on photon polarization/phase to encode qubits, our proposal utilizes photons of different frequencies. Qubits are thus expected to reach longer propagation distances due to the photon frequency state being more robust against mechanical and/or thermal fluctuations of the transmitting medium. Finally, we put forth an extension to a security-enhanced four-character-alphabet (qu-quarts) QKD scheme.
قيم البحث
اقرأ أيضاً
We report an experimental demonstration of effective entanglement in a prepare&measure type of quantum key distribution protocol. Coherent polarization states and heterodyne measurement to characterize the transmitted quantum states are used, thus en
abling us to reconstruct directly their Q-function. By evaluating the excess noise of the states, we experimentally demonstrate that they fulfill a non-separability criterion previously presented by Rigas et al. [J. Rigas, O. Guhne, N. Lutkenhaus, Phys. Rev. A 73, 012341 (2006)]. For a restricted eavesdropping scenario we predict key rates using postselection of the heterodyne measurement results.
Due to physical orientations and birefringence effects, practical quantum information protocols utilizing optical polarization need to handle misalignment between preparation and measurement reference frames. For any such capable system, an important
question is how many resources -- e.g., measured single photons -- are needed to reliably achieve alignment precision sufficient for the desired quantum protocol. Here we study the performance of a polarization-frame alignment scheme used in prior laboratory and field quantum key distribution (QKD) experiments by performing Monte Carlo numerical simulations. The scheme utilizes, to the extent possible, the same single-photon-level signals and measurements as for the QKD protocol being supported. Even with detector noise and imperfect sources, our analysis shows that only a small fraction of resources from the overall signal -- a few hundred photon detections, in total -- are required for good performance, restoring the state to better than 99% of its original quality.
Challenges facing the deployment of quantum key distribution (QKD) systems in critical infrastructure protection applications include the optical loss-key rate tradeoff, addition of network clients, and interoperability of vendor-specific QKD hardwar
e. Here, we address these challenges and present results from a recent field demonstration of three QKD systems on a real-world electric utility optical fiber network.
We give a direct product theorem for the entanglement-assisted interactive quantum communication complexity of an $l$-player predicate $mathsf{V}$. In particular we show that for a distribution $p$ that is product across the input sets of the $l$ pla
yers, the success probability of any entanglement-assisted quantum communication protocol for computing $n$ copies of $mathsf{V}$, whose communication is $o(log(mathrm{eff}^*(mathsf{V},p))cdot n)$, goes down exponentially in $n$. Here $mathrm{eff}^*(mathsf{V}, p)$ is a distributional version of the quantum efficiency or partition bound introduced by Laplante, Lerays and Roland (2014), which is a lower bound on the distributional quantum communication complexity of computing a single copy of $mathsf{V}$ with respect to $p$. As an application of our result, we show that it is possible to do device-independent quantum key distribution (DIQKD) without the assumption that devices do not leak any information after inputs are provided to them. We analyze the DIQKD protocol given by Jain, Miller and Shi (2017), and show that when the protocol is carried out with devices that are compatible with $n$ copies of the Magic Square game, it is possible to extract $Omega(n)$ bits of key from it, even in the presence of $O(n)$ bits of leakage. Our security proof is parallel, i.e., the honest parties can enter all their inputs into their devices at once, and works for a leakage model that is arbitrarily interactive, i.e., the devices of the honest parties Alice and Bob can exchange information with each other and with the eavesdropper Eve in any number of rounds, as long as the total number of bits or qubits communicated is bounded.
I review the ideas and main results in the derivation of security bounds in quantum key distribution for keys of finite length. In particular, all the detailed studies on specific protocols and implementations indicate that no secret key can be extra
cted if the number of processed signals per run is smaller than 10^5-10^6. I show how these numbers can be recovered from very basic estimates.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
