Implementation of Grover’s Quantum Search Algorithm using Rigetti Forest
Anthony1, Arya Wicaksana2
1Anthony, Department of Informatics, Universitas Multimedia Nusantara, Tangerang Indonesia.
2Arya Wicaksana, Department of Informatics, Universitas Multimedia Nusantara, Tangerang Indonesia.
Manuscript received on 27 September 2019 | Revised Manuscript received on 09 November 2019 | Manuscript Published on 22 November 2019 | PP: 110-114 | Volume-8 Issue-6S3 September 2019 | Retrieval Number: F10180986S319/19©BEIESP | DOI: 10.35940/ijeat.F1018.0986S319
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
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.
Keywords: Grover, Quantum Algorithm, Rigetti Forest, Unsorted Search.
Scope of the Article: Algorithm Engineering