Journal of Military Science and Technology

Implementation Grover’s search algorithm on IBM Eagle r3

Hong Luu Thu, Ninh Nguyen Duy

Published Nov 25, 2024• 0 citations

Abstract

Nowadays, quantum computing has emerged as a global technology trend, attracting active research worldwide. One of the most popular quantum algorithms is the quantum search algorithm, commonly known as Grover's algorithm, for unstructured search purposes. This paper presents the implementation of the algorithm with a search space of 3 to 10 qubits using the Python-based Qiskit tool developed by IBM. The implementation results on the IBM QSAM simulator and on the IBM Eagle r3 quantum hardware are analyzed and compared. This paper also provides results with circuits of varying iteration numbers. Finally, the paper discusses the advantages of this quantum search algorithm compared to traditional methods, and the obstacles towards realizing its hardware implementation.

DOI: 10.54939/1859-1043.j.mst.99.2024.119-124

Related papers

Grover’s Algorithm in a 4-Qubit Search Space

Saasha Joshi, Deepti Gupta

This paper provides an introduction to a quantum search algorithm, known as Grover’s Algorithm, for unsorted search purposes. The algorithm is implemented in a search space of 4 qubits using the Python-based Qiskit SDK by IBM. While providing detailed proof, the computational complexity of the algorithm is generalized to n qubits. The implementation results obtained from the IBM QASM Simulator and IBMQ Santiago quantum backend are analyzed and compared. Finally, the paper discusses the challenges faced in implementation and real-life applications of the algorithm hitherto. Overall, the implementation and analysis depict the advantages of this quantum search algorithm over its classical counterparts.

Journal of quantum computingJan 1, 20215 citations

Evaluating the Suitability of IBM Quantum Hardware for Practical Quantum Search

Jyothikrishna Sajja, Vikrant Abhishek, Arige Sumanth +3 more

Through the application of concepts derived from quantum mechanics, quantum computers assert that they are capable of doing certain tasks with more efficiency than classical computers. For the purpose of accelerating the process of solving unstructured search problems, a well-known quantum technique known as Grover’s algorithm, is utilized. As part of this investigation, the IBM Q 5 Tenerife is compared to the quantum hardware that is already available from IBM, and the feasibility of adopting Grover’s approach is evaluated. An analysis of the algorithm’s component pieces, such as the diffusion operator and the oracle, is included in this presentation. Additionally, simulation and experimental data are also included. The findings that we obtained demonstrate that the accuracy of the 3-qubit Grover’s approach is improved when it is executed. In contrast, the 4-qubit Grover’s technique demonstrates a rise in accuracy that is not as noticeable as the other algorithm. The execution time of the 3-qubit Grover’s approach is successfully reduced from 84.33 second to just 5 second by both of the methods, which is something that should be included in the discussion.

IEEE Applied Sensing Conference (APSCON)Jan 20, 20250 citations

Evaluating the Practicality of Grover’s Algorithm for Large-Scale Data Search via Quantum Simulation

Lovish Bhatia, Vinay Shankar Pandey, Ajay K. Sharma

Abstract Quantum computing can solve some classes of problems faster than classical computing. Among the greatest quantum algorithms to showcase this benefit is Grover's search algorithm, which has a quadratic speed-up for unstructured search problems. In this study, we present an implementation of Grover’s algorithm on a large-scale dataset comprising approximately 131,072 (217) names. We contrast its efficiency with the classical linear search based on time complexity, scalability, and the likelihood of success. The experiment was conducted using Qiskit on a quantum simulator, where several query scenarios were implemented to verify the algorithm's efficiency and accuracy. Our findings highlight the theoretical advantage of Grover’s algorithm in situations involving large data sets, while also discussing real-world limitations such as gate noise, qubit number, and circuit depth as we move towards actual quantum hardware. This study serves as a step toward evaluating the real-world relevance of quantum search algorithms and provides information on current challenges and future directions in quantum information retrieval.

Jul 2, 20251 citation

Classical vs Quantum Search: Experimental Performance Analysis of Grover's Algorithm on Real IBM Quantum Hardware

Kundan Kumar Sahu

Grover's quantum search algorithm provides a proven quadratic speedup over classical linear search for unstructured databases. While its theoretical advantage is well established, experimental validation on real noisy intermediate-scale quantum (NISQ) hardware remains limited by noise, decoherence, and hardware constraints. In this work, we present an experimental comparison between classical linear search and Grover's quantum search algorithm executed on IBM Quantum real superconducting hardware using Qiskit Runtime. A four-qubit implementation corresponding to a 16-element search space is evaluated across multiple experimental runs. The results demonstrate consistent amplitude amplification, achieving an average success probability of 54.25% and an amplification factor of 8.68× over random guessing. Although classical execution remains faster in wall-clock time due to quantum hardware overhead, the experiment empirically validates the algorithmic advantage of Grover's search and quantifies the performance gap between ideal and real quantum processors in the NISQ era.

Dec 29, 20251 citation

Verifying Grover’s Quantum Algorithm: From Theory to Practice

Abel C. H. Chen

With the growth of quantum computing hardware technology, more developers are becoming involved in the design and development of quantum algorithms, leading to the creation of practical applications that align with real-world needs through the combination of quantum hardware and software. Among quantum algorithms, the most well-known include Grover’s algorithm and Shor’s algorithm. Grover’s algorithm can quickly provide search results, making it highly valuable for search-related applications. In light of this, this study primarily examines the theoretical usability of Grover’s algorithm and explores its limitations. Additionally, on the practical side, this research implements Grover’s algorithm using IBM Quantum Computing and the IBM Qiskit package. By comparing simulation results with those obtained from execution on real quantum computers, the study discusses the current limitations of quantum computing hardware technology.

International Conference on Circuit, Power and Computing TechnologiesAug 7, 20250 citations

4-qubit Grover's algorithm implemented for the ibmqx5 architecture

Philip Strömberg, Vera Blomkvist Karlsson

Quantum computing is a quickly growing field of research thanks to recent hardware advances. The quantum mechanical properties of quantum computers allow them to solve certain families of problems faster than classical computers. A quantum algorithm solving such a problem is Grover's algorithm, which finds an element in an unordered set faster than any classical search algorithm. In this paper an implementation of a 4-qubit Grover's algorithm for the IBM Q computer ibmqx5 is presented. Executing the implementation on an ibmqx5 simulator yield results in line with the theoretically optimal results. The accuracy of the ibmqx5 simulation results compared to the ibmqx5 execution results suggests that current hardware is not yet suitable,due to required complexity of the circuits for a 4-qubit Grover implementation.

Jan 1, 20188 citations