scholarly journals High-dimensional entanglement for long distance quantum communication

2011 ◽  
Vol 60 (6) ◽  
pp. 060308
Author(s):  
Yin Juan ◽  
Qian Yong ◽  
Li Xiao-Qiang ◽  
Bao Xiao-Hui ◽  
Peng Cheng-Zhi ◽  
...  
2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Beatrice Da Lio ◽  
Daniele Cozzolino ◽  
Nicola Biagi ◽  
Yunhong Ding ◽  
Karsten Rottwitt ◽  
...  

AbstractQuantum key distribution (QKD) protocols based on high-dimensional quantum states have shown the route to increase the key rate generation while benefiting of enhanced error tolerance, thus overcoming the limitations of two-dimensional QKD protocols. Nonetheless, the reliable transmission through fiber links of high-dimensional quantum states remains an open challenge that must be addressed to boost their application. Here, we demonstrate the reliable transmission over a 2-km-long multicore fiber of path-encoded high-dimensional quantum states. Leveraging on a phase-locked loop system, a stable interferometric detection is guaranteed, allowing for low error rates and the generation of 6.3 Mbit/s of a secret key rate.


Author(s):  
C. W. Chou ◽  
S. V. Polyakov ◽  
D. Felinto ◽  
H. de Riedmatten ◽  
S. J. van Enk ◽  
...  

Author(s):  
Linshu Li ◽  
Sreraman Muralidharan ◽  
Chang-Ling Zou ◽  
Victor V. Albert ◽  
Jungsang Kim ◽  
...  

2001 ◽  
Vol 1 (3) ◽  
pp. 87-88
Author(s):  
P Kok ◽  
H Lee ◽  
N Cerf ◽  
J Dowling

Perspective


2012 ◽  
Vol 12 (5&6) ◽  
pp. 448-460
Author(s):  
Iordanis Kerenidis ◽  
Stephanie Wehner

Any two-party cryptographic primitive can be implemented using quantum communication under the assumption that it is difficult to store a large number of quantum states perfectly. However, achieving reliable quantum communication over long distances remains a difficult problem. Here, we consider a large network of nodes with only neighboring quantum links. We exploit properties of this cloud of nodes to enable any two nodes to achieve security even if they are not directly connected. Our results are based on techniques from classical cryptography and do not resort to technologically difficult procedures like entanglement swapping. More precisely, we show that oblivious transfer can be achieved in such a network if and only if there exists a path in the network between the sender and the receiver along which all nodes are honest. Finally, we show that useful notions of security can still be achieved when we relax the assumption of an honest path. For example, we show that we can combine our protocol for oblivious transfer with computational assumptions such that we obtain security if either there exists an honest path, or, as a backup, at least the adversary cannot solve a computational problem.


2016 ◽  
Vol 6 (1) ◽  
Author(s):  
Sreraman Muralidharan ◽  
Linshu Li ◽  
Jungsang Kim ◽  
Norbert Lütkenhaus ◽  
Mikhail D. Lukin ◽  
...  

2019 ◽  
Vol 2 (12) ◽  
pp. 1900038 ◽  
Author(s):  
Daniele Cozzolino ◽  
Beatrice Da Lio ◽  
Davide Bacco ◽  
Leif Katsuo Oxenløwe

Sign in / Sign up

Export Citation Format

Share Document