Date of Publication :8th September 2020

Abstract: The quest for reduced complexityand increased computing efficiency remains unsolved with present classical computers. Classical computers deal with problems whose complexity increase linearly. Most real-life problems have the complexity growing exponentially with the number of inputs rather than linearly. This poses a fundamental problem in our current computers. To achieve the pinnacle of speed, we require the necessity of quantum computers. Currently, there exist some algorithms utilizing the better side of quantum computers. For example, Shor’s algorithm performs factoring of a large integer in Polynomial time, whereas classical factoring algorithms can do it in exponential time. On the other hand, cryptosystems such as RSA are no more secure with the era of quantum computers. In this paper we briefly survey the basic knowledge of quantum computers, quantum cryptography and the underlying algorithms and the application.

Reference :