Comparisons of Conventional Computing and Quantum Computing Approaches

Abstract

Quantum computers are capable of ultra fast computation in the fields where classical computers fail. Even though quantum computers are nowhere near commercialization, many researchers have developed quantum algorithms in fields such as modern encryption and molecular simulation, which, in theory, are exponentially faster than their classical counterparts. In this case, this paper will discuss the advantages of quantum computers over classical computers in those fields by examining and analyzing the various quantum algorithms. To be specific, the develop routine as well as detail examples will be exhibited to illustrate the differences and preferences. In addition, this study will also fully aware of the challenges that quantum computing researchers are facing. On this basis, possible limitations of quantum computers are also presented. The aim is to promote interest in quantum computing by introducing their supremacy in modern encryption and biological science. These results shed light on guiding further exploration of quantum computing algorithms.