اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExperimental quantum key distribution based on a Bell test
241
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We report on a complete free-space field implementation of a modified Ekert91 protocol for quantum key distribution using entangled photon pairs. For each photon pair we perform a random choice between key generation and a Bell inequality. The amount of violation is used to determine the possible knowledge of an eavesdropper to ensure security of the distributed final key.
قيم البحث
اقرأ أيضاً
Quantum information and quantum foundations are becoming popular topics for advanced undergraduate courses. Many of the fundamental concepts and applications in these two fields, such as delayed choice experiments and quantum encryption, are comprehe
nsible to undergraduates with basic knowledge of quantum mechanics. In this paper, we show that the quantum eraser, usually used to study the duality between wave and particle properties, can also serve as a generic platform for quantum key distribution. We present a pedagogical example of an algorithm to securely share random keys using the quantum eraser platform and propose its implementation with quantum circuits.
Quantum key distribution(QKD) is one of the most significant areas in quantum information theory. For nearly four decades, substantial QKD protocols and cryptographic methods are developed. In early years, the security of QKD protocols is depend on s
witching different bases, which, in fact, is based on non-orthogonal states. The most famous example is the BB84 protocol. Later, other techniques were developed for orthogonal states cryptography. Representations of such protocols include the GV protocol and order-rearrangement protocols. It might be harder to implement protocols based on orthogonal states since they require extra techniques to obtain the security. In this paper, we present two QKD protocols based on orthogonal states. One of them needs not to employ order-rearrangement techniques while the other needs. We give analyses of their security and efficiency. Also, anti-noisy discussions would be given, namely, we modify the protocols such that they could be implemented in noisy channels as in noiseless ones without errors. Our protocols are highly efficient when considering consumptions of both qubits and classical bits while they are robust over several noisy channels. Moveover, the requirement of maximally entangled states could be less than previous protocols and so the efficiency of measurements could be increased. Keywords: Quantum key distribution; Order-rearrangement; Orthogonal states; Noise; Qubit.
A quantum key distribution protocol based on time coding uses delayed one photon pulses with minimum time-frequency uncertainty product. Possible overlap between the pulses induces an ambiguous delay measurement and ensures a secure key exchange.
Local realistic models cannot completely describe all predictions of quantum mechanics. This is known as Bells theorem that can be revealed either by violations of Bell inequality, or all-versus-nothing proof of nonlocality. Hardys paradox is an impo
rtant all-versus-nothing proof and is considered as the simplest form of Bells theorem. In this work, we theoretically build the general framework of Hardy-type paradox based on Bell inequality. Previous Hardys paradoxes have been found to be special cases within the framework. Stronger Hardy-type paradox has been found even for the two-qubit two-setting case, and the corresponding successful probability is about four times larger than the original one, thus providing a more friendly test for experiment. We also find that GHZ paradox can be viewed as a perfect Hardy-type paradox. Meanwhile, we experimentally test the stronger Hardy-type paradoxes in a two-qubit system. Within the experimental errors, the experimental results coincide with the theoretical predictions.
Decoy-state quantum key distribution (QKD) is a standard technique in current quantum cryptographic implementations. Unfortunately, existing experiments have two important drawbacks: the state preparation is assumed to be perfect without errors and t
he employed security proofs do not fully consider the finite-key effects for general attacks. These two drawbacks mean that existing experiments are not guaranteed to be secure in practice. Here, we perform an experiment that for the first time shows secure QKD with imperfect state preparations over long distances and achieves rigorous finite-key security bounds for decoy-state QKD against coherent attacks in the universally composable framework. We quantify the source flaws experimentally and demonstrate a QKD implementation that is tolerant to channel loss despite the source flaws. Our implementation considers more real-world problems than most previous experiments and our theory can be applied to general QKD systems. These features constitute a step towards secure QKD with imperfect devices.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
