QUANTUM DIRECT COMMUNICATION BASED ON QUANTUM SEARCH ALGORITHM

2010 ◽  
Vol 08 (03) ◽  
pp. 443-450 ◽  
Author(s):  
CHUAN WANG ◽  
LIANG HAO ◽  
SI YU SONG ◽  
GUI LU LONG

Quantum direct communications, including deterministic secure quantum communication and quantum secure direct communication protocol using two-qubit quantum search algorithm are proposed in this paper. Secret messages are encoded by two-qubit unitary operations and exchanged by the two communication parties directly. We discussed the security of the protocol under intercept-resend attack and individual attack. We found that the protocols are secure against eavesdropping attacks.

2014 ◽  
Vol 54 (7) ◽  
pp. 2436-2445 ◽  
Author(s):  
Shu-Jiang Xu ◽  
Xiu-Bo Chen ◽  
Lian-Hai Wang ◽  
Xin-Xin Niu ◽  
Yi-Xian Yang

2014 ◽  
Vol 898 ◽  
pp. 663-667
Author(s):  
Cheng Hong Zhou ◽  
Yi Liu ◽  
Wei Ping Qian

In this article, we first review the classical satellite telecontrol system, including space-ground closed loop comparison system, and analyse the insufficient from the perspectives of security and reliability. Subsequently the development of quantum communication is summarized, besides, the advantages of quantum communication used for satellite telecontrol is expounded. Finally we put forward a simplified quantum secure direct communication protocol for satellite telecontrol and discuss the quantum telecontrol system for further development.


2011 ◽  
Vol 68 (7-8) ◽  
pp. 1208-1218 ◽  
Author(s):  
Jack Tsai ◽  
Fu-Yuen Hsiao ◽  
Yi-Ju Li ◽  
Jen-Fu Shen

2004 ◽  
Vol 4 (3) ◽  
pp. 201-206
Author(s):  
L. Grover ◽  
T. Rudolph

Quantum search is a technique for searching $N$ possibilities for a desired target in $O(\sqrt{N})$ steps. It has been applied in the design of quantum algorithms for several structured problems. Many of these algorithms require significant amount of quantum hardware. In this paper we propose the criterion that an algorithm which requires $O(S)$ hardware should be considered significant if it produces a speedup of better than $O\left(\sqrt{S}\right)$ over a simple quantum search algorithm. This is because a speedup of $O\left(\sqrt{S}\right)$ can be trivially obtained by dividing the search space into $S$ separate parts and handing the problem to $S$ independent processors that do a quantum search (in this paper we drop all logarithmic factors when discussing time/space complexity). Known algorithms for collision and element distinctness exactly saturate the criterion.


Sign in / Sign up

Export Citation Format

Share Document