The Principles, Algorithms and State-of-Art Applications of Quantum Computing

Abstract

Abstract Contemporarily, quantum computing has become a popular topic, which is a new approach that is different from classic computing. To be specific, it can deal with information by using mathematical modeling that used to represent quantum mechanics, including superposition, interference, and entanglement. In quantum Computing, information is storage in ‘qubit’, whereas classic computer use bit to store information. This article aims to introduce the principles and some algorithms of quantum computing, and then discuss some up-to-date important development. There are two important algorithms are mentioned in this article, Grover’s algorithms and Shor’s algorithms. According to the analysis, Grover’s algorithms is potentially faster than classic algorithms. However, it requires millions of qubits to make it. Besides, Shor’s algorithms have challenged classic encryption (RSA encryption). Two quantum computer Google Sycamore and Jiuzhang are also mentioned here. The interesting thing is, for some specific question, Jiuzhang performed better than classic computers. Finally, it is found out that the quantum computing is generally slower that classic computer now, due to the restriction of qubit numbers. However, quantum computing still has an advantage in some specific question. These results shed light on guiding further exploration of quantum computer designing.