Quantum Computing - The Next Big Leap in the World of Computation

With the rapid onset of the Quantum Computing (QC) paradigm in the field of computer science, the QC approach could enable better outcomes to solve some of the classical problems. It is plausible to speculate that quantum computers could outperform classical computers in machine learning tasks because quantum systems exhibit peculiar patterns that conventional systems are assumed to be incapable of producing. This work introduces the QC approach to Machine Learning solutions in computer science and provides a comparison of the performances of QC-based approaches against the classical ones. In addition, an attempt to discuss the potential of QC in solving classical computer science problems such as Shor’s algorithm, the Travelling Salesman problem(TSP), and the prime factorization problem is made through the empirical study of the same.In conclusion, we analyze the outcomes of our practical investigation and devise potential improvements that can be made to the QC methods employed by the solutions.