Title: SIMULATION AND EVALUATE THE PERFORMANCE OF GROVER’S ALGORITHM WITH RESPECT TO CLASSICAL ALGORITHM

Year of Publication: 2012
Page Numbers: 38-43
Authors: Md Adit Hasan, Atahar Hossain, Jahangir Kabir
Conference Name: The International Conference on Computing, Networking and Digital Technologies (ICCNDT2012)
- Bahrain

Abstract:


Quantum computing uses the harness of atoms and molecules to perform information processing. We have already known about how our classical computer performs operation on data. There are different types of algorithm and method for searching data in a large database. But these algorithms are not perfect for an unsorted database. According to classical algorithm, it needs more time to find a specific element in large unsorted database. If we use Grover’s algorithm for this purpose then we can discover the difference. Quantum algorithm has high efficiency and its time complexity is too low. Classical algorithm can identify an item in the list of N element in O (N) times but Quantum algorithm can identify an item in the list of N element in O (√N) times. So it is too much faster from any known algorithm. We made a simulation of quantum algorithm and evaluate the performance with respect to classical algorithm.