Investigate the performance of real-time adaptive optics correction in a turbulent high-dimensional quantum communication channel

Author(s):  
Jiapeng Zhao ◽  
Yiyu Zhou ◽  
Boris Braverman ◽  
Cong Liu ◽  
Kai Pang ◽  
...  
2020 ◽  
Vol 28 (10) ◽  
pp. 15376
Author(s):  
Jiapeng Zhao ◽  
Yiyu Zhou ◽  
Boris Braverman ◽  
Cong Liu ◽  
Kai Pang ◽  
...  

Author(s):  
Евгений Викторович Василиу ◽  
Иван Романович Гулаков ◽  
Андрей Олегович Зеневич ◽  
Александр Михалович Тимофеев ◽  
Сергей Валентинович Николаенко

2007 ◽  
Vol 17 (03) ◽  
pp. 323-335 ◽  
Author(s):  
NAYA NAGY ◽  
SELIM G. AKL

The aim of quantum key distribution protocols is to establish a secret key among two parties with high security confidence. Such algorithms generally require a quantum channel and an authenticated classical channel. This paper presents a totally new perception of communication in such protocols. The quantum communication alone satisfies all needs of array communication between the two parties. Even so, the quantum communication channel does not need to be protected or authenticated whatsoever. As such, our algorithm is a purely quantum key distribution algorithm. The only certain identification of the two parties is through public keys.


2012 ◽  
Vol 12 (5&6) ◽  
pp. 490-501
Author(s):  
Jia-Jun Ma ◽  
Fen-Zhuo Guo ◽  
Qian Yang ◽  
Yan-Bing Li ◽  
Qiao-Yan Wen

In this paper, we present a quantum strong coin flipping protocol. In this protocol, an EPR pair and a quantum memory storage are made use of, and losses in the quantum communication channel and quantum memory storage are all analyzed. We obtain the bias in the fair scenario as a function of $p$, where $p$ is the probability that the particle in Bob's quantum memory storage is lost, which means our bias varies as the degree of losses in the quantum memory storage changes. Therefore we call our protocol semi-loss-tolerant. We also show that the bias decreases with decreasing $p$. When $p$ approaches $0$, the bias approaches 0.3536, which is less than that of all the previous loss-tolerant protocols. Details of both parties' optimal cheating strategies are also given and analyzed. What's more, experimental feasibility is discussed and demonstrated. Compared with previous qubit-based loss-tolerant SCF protocols, we introduce the EPR pair to keep our protocol loss-tolerant while trying to push down the bias. In addition, a quantum memory storage is used and the losses in it has been taken into account. We obtain the bias in the fair scenario as a function of $p$, where $p$ is the probability that the particle in Bob's quantum memory storage is lost, which means our bias varies as the degree of losses in the quantum memory storage changes. We also show that the bias decreases with decreasing $p$. When $p$ approaches $0$, the bias approaches 0.3536, which is less than that of all the previous loss-tolerant protocols. Details of both parties' optimal cheating strategies are also given and analyzed. Besides, experimental feasibility is discussed and demonstrated.


Sign in / Sign up

Export Citation Format

Share Document