Design and analysis model of open space quantum cryptography communication

Abstract

Nowadays, classical computer plays the significant roles for every aspect of problems. Different element of classical computer make supports to mankind to relax his/her complicated works. Different element means different classical equipment such as robotics, AI, handheld devices, etc. However, classical computer has few shortcomings in terms of storage efficiency, computation efficiency, information reliability, information security, and versatility, etc. Recently, most workplace is used Internet for information transmission, however information is not secure. We need to find others alternative which are superset in every aspect to classical computer. Quantum computer is appropriate alternative for information security, information reliability, and computation efficiency. Few quantum algorithms such as Shor s and Grover s showed its newlinecomputation power is efficient than analogous classical algorithms. Hence, it is need to determine the few well-known classical computation efficiency and corresponding quantum algorithms computation efficiency. newlineWe investigate few well-known quantum algorithms Shor s, Grover s, Simon s, Jozsa s, Deutsch-Jozsa s with classical algorithms regarding of storage, speed, and computation. Furthermore, we focus on quantum communication and computation concern the open space, subsequently, developed models of quantum entities search from an unstructured database, quantum cloud computing, and quantum search engine. All these models are more secure than counterpart classical models concerned the information security. newlineAfter investigation we find that quantum algorithms are more efficient than newlineclassical algorithms. The n bits of the classical computer need log2 n bits in a newlinequantum computer; hence every quantum algorithm will be more efficient than newlineadvanced classical algorithms once scalable quantum computer materialise.