Analysis of Classical and Quantum Computing Based on Grover and Shor Algorithm

Quantum Computing is the study of evolving computing technology. It works with qubits (quantum bits), unlike classical computing (which works on classical bits). A quantum computer can do multiple tasks at a time and that’s why they are more efficient than traditional computers. In this paper, it has been thoroughly discussed about qubits, Superposition of qubits, gates, Superdense Coding, quantum programming languages and specially algorithms and how they are better than the best known classical algorithms. There is an exponential speedup in many of the operations performed by quantum algorithms as compared to classical algorithms. They are compared on their complexities. Most highly recognized algorithms in the field of quantum computing are: Grover’s algorithm for database search and Shor’s algorithm for factoring large integers into two prime numbers efficiently. In future, if quantum computers are made, it would be easier to encrypt the information that should not be revealed such as government databases in a new and secure way. Here, we will discuss about the commands used in quantum computing language (QCL) and mathematical proofs of few of the algorithms such as Deutsch–Jozsa algorithm, etc.