Anthony, Anthony and Wicaksana, Arya (2019) Implementation of Grover’s Quantum Search Algorithm using Rigetti Forest. International Journal of Engineering and Advanced Technology (IJEAT), 8 (653). ISSN 2249 – 8958
Full text not available from this repository.Abstract
Grover’s quantum search algorithm allows quadratic speedup in unsorted search problem by utilizing amplitude amplification trick in quantum computing. In this paper, an approach to implement Grover’s quantum search algorithm is proposed. The implementation is done using Rigetti Forest and Python. The testing and evaluation processes are carried on in two computers with different hardware specifications to derive more information from the result. The results are measured in user time and compared with implementation from Quantum Computing Playground. The user time of this implementation for 10 qubits and 1024 data is slower compared to Quantum Computing Playground’s implementation. The proposed implementation can be improved by calculating the probability of Grover’s quantum search algorithm in finding the appropriate search result.
| Item Type: | Article |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming |
| Divisions: | Faculty of Engineering & Informatics > Informatics |
| Depositing User: | Administrator UMN Library |
| Date Deposited: | 14 Oct 2021 08:20 |
| Last Modified: | 14 Oct 2021 08:20 |
| URI: | https://kc.umn.ac.id/id/eprint/18774 |
Actions (login required)
 |
View Item |
