QUANTUM CIRCUIT FOR ENTANGLING PROBE

2006 ◽  
Vol 20 (11n13) ◽  
pp. 1297-1303
Author(s):  
HOWARD E. BRANDT

The quantum circuit and design are given for an optimized entangling probe attacking the BB84 protocol of quantum key distribution and yielding maximum information to the probe. Probe photon polarization states become entangled with the signal states on their way between the legitimate transmitter and receiver.

2006 ◽  
Vol 359 (2) ◽  
pp. 126-128 ◽  
Author(s):  
Ming Gao ◽  
Lin-Mei Liang ◽  
Cheng-Zu Li ◽  
Chen-Lin Tian

2005 ◽  
Vol 03 (supp01) ◽  
pp. 143-143 ◽  
Author(s):  
HOI-KWONG LO

Quantum key distribution (QKD) allows two parties to communicate in absolute security based on the fundamental laws of physics. Up till now, it is widely believed that unconditionally secure QKD based on standard Bennett-Brassard (BB84) protocol is limited in both key generation rate and distance because of imperfect devices. Here, we solve these two problems directly by presenting new protocols that are feasible with only current technology. Surprisingly, our new protocols can make fiber-based QKD unconditionally secure at distances over 100km (for some experiments, such as GYS) and increase the key generation rate from O(η2) in prior art to O(η) where η is the overall transmittance. Our method is to develop the decoy state idea (first proposed by W.-Y. Hwang in "Quantum Key Distribution with High Loss: Toward Global Secure Communication", Phys. Rev. Lett. 91, 057901 (2003)) and consider simple extensions of the BB84 protocol. This part of work is published in "Decoy State Quantum Key Distribution", . We present a general theory of the decoy state protocol and propose a decoy method based on only one signal state and two decoy states. We perform optimization on the choice of intensities of the signal state and the two decoy states. Our result shows that a decoy state protocol with only two types of decoy states—a vacuum and a weak decoy state—asymptotically approaches the theoretical limit of the most general type of decoy state protocols (with an infinite number of decoy states). We also present a one-decoy-state protocol as a special case of Vacuum+Weak decoy method. Moreover, we provide estimations on the effects of statistical fluctuations and suggest that, even for long distance (larger than 100km) QKD, our two-decoy-state protocol can be implemented with only a few hours of experimental data. In conclusion, decoy state quantum key distribution is highly practical. This part of work is published in "Practical Decoy State for Quantum Key Distribution", . We also have done the first experimental demonstration of decoy state quantum key distribution, over 15km of Telecom fibers. This part of work is published in "Experimental Decoy State Quantum Key Distribution Over 15km", .


2016 ◽  
Vol 24 (3) ◽  
pp. 2619 ◽  
Author(s):  
A. V. Gleim ◽  
V. I. Egorov ◽  
Yu. V. Nazarov ◽  
S. V. Smirnov ◽  
V. V. Chistyakov ◽  
...  

2010 ◽  
Vol 10 (1&2) ◽  
pp. 60-76
Author(s):  
L. Lydersen ◽  
J. Skaar

We consider the security of the Bennett-Brassard 1984 (BB84) protocol for Quantum Key Distribution (QKD), in the presence of bit and basis dependent detector flaws. We suggest a powerful attack that can be used in systems with detector efficiency mismatch, even if the detector assignments are chosen randomly by Bob. A security proof is provided, valid for any basis dependent, possibly lossy, linear optical imperfections in the channel/receiver/detectors. The proof does not assume the so-called squashing detector model.


Author(s):  
Ming Fang ◽  
Ya-Ping Li ◽  
Li Fei

Quantum key distribution (QKD) allows authenticated parties to share secure keys. Its security comes from quantum physics rather than computational complexity. The previous work has been able to demonstrate the security of the BB84 protocol based on the uncertainty principle, entanglement purification and information theory. In the security proof method based on entanglement purification, it is assumed that the information of Calderbank–Shor–Steane (CSS) error correction code cannot be leaked, otherwise, it is insecure. However, there is no quantitative analysis of the relationship between the parameter of CSS code and the amount of information leaked. In the attack and defense strategy of the actual quantum key distribution system, especially in the application of the device that is easy to lose or out of control, it is necessary to assess the impact of the parameter leakage. In this paper, we derive the relationship between the leaked parameter of CSS code and the amount of the final key leakage based on the BB84 protocol. Based on this formula, we simulated the impact of different CSS code parameter leaks on the final key amount. Through the analysis of simulation results, the security of the BB84 protocol is inversely proportional to the value of [Formula: see text] and [Formula: see text] in the case of the CSS code leak.


2006 ◽  
Vol 358 (5-6) ◽  
pp. 386-389 ◽  
Author(s):  
Xiaobao Liu ◽  
Zhilie Tang ◽  
Changjun Liao ◽  
Yiqun Lu ◽  
Feng Zhao ◽  
...  

2010 ◽  
Vol 20 (03) ◽  
pp. 227-237 ◽  
Author(s):  
MARIUS NAGY ◽  
SELIM G. AKL

We develop an entanglement verification method not based on Bell inequalities, that achieves a higher reliability per number of qubits tested than existing procedures of this kind. Used in a quantum cryptographic context, the method gives rise to a new protocol for distributing classical keys through insecure quantum channels. The cost of quantum and classical communication is significantly reduced in the new protocol, while its security is increased with respect to other entanglement-based protocols exchanging the same number of qubits. To achieve this performance, our scheme relies on a simple quantum circuit and the ability to store qubits.


Sign in / Sign up

Export Citation Format

Share Document