Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Implementation of Grover's quantum search algorithm with error mitigation at IBM Q computers

Yulun Wang, Robert J. Harrison, Predrag Krstić

Published Mar 5, 2019• 0 citations
OpenAlex

Related papers

Implementation of efficient quantum search algorithms on NISQ computers

Kun Zhang, Pooja Rao, Kwangmin Yu +2 more

arXiv:2102.01783•Quantum Information Processing•Jul 1, 2021•51 citations

Error Mitigation of Grover’s Quantum Search Algorithm

Grover’s quantum search algorithm delivers quadratic speedup over classical counterparts for finding an item in unstructured database. But the accuracy of the algorithm degrades as the number of qubits are increased. Noises of various types affect the accuracy of the Grover’s algorithm. The imperfect measurement on the qubit results in measurement errors appears to be one of the factors which limit the scalability of near-term quantum devices/algorithms. This paper is focused on the implementation of measurement error mitigation technique on Grover’s algorithm up to 4-qubits. The measurement error mitigation model for Grover’s algorithm is developed and implemented on the real-time quantum computer. The accuracy of Grover’s algorithm up to 4-qubits with and without measurement errors is evaluated and compared. The results indicate that measurement error mitigation technique mitigates the measurement errors of the Grover’s algorithm and improves its accuracy.

Indian Journal of Pure & Applied Physics•Jul 28, 2022•4 citations

Circuit optimization of Grover quantum search algorithm

Xi Wu, Qingyi Li, Zhiqiang Li +5 more

Quantum Information Processing•Jan 18, 2023•20 citations

Comparing Zero-Noise Extrapolation Models on a 6-Qubit Grover's Algorithm

Prajwal Avadhani

Quantum computers have the potential to address computational problems beyond the practical capabilities of classical systems, but Noisy Intermediate-Scale Quantum (NISQ) processors remain limited by errors that accumulate during circuit execution. Quantum Error Mitigation (QEM), particularly Zero-Noise Extrapolation (ZNE), offers a way to reduce these errors without requiring additional physical qubits. However, ZNE has been studied extensively in relatively small or shallow circuits, leaving its effectiveness in deep, non-variational algorithms less explored. This project investigates whether combining readout mitigation and ZNE can mitigate errors in a deep, six-qubit Grover's search algorithm. The circuit was compiled onto IBM's 133-qubit FakeTorino simulated backend, reaching a depth of 1,118 and containing 369 entangling gates. Under simulated noise, the unmitigated probability of measuring the target state was 3.36%, compared with a uniform random-guessing probability of 1.5625%. Digital unitary gate folding and readout error mitigation were subsequently applied across four progressively increased noise-scaling sets (S1–S4), and scale factors. Four extrapolation models (Linear, Quadratic, Poly-Exponential, and Padé) were evaluated. The Poly-Exponential model achieved the highest average target-state probability, reaching 6.91% at S4, approximately 2.06 times the unmitigated probability. These results demonstrate that combining readout mitigation with ZNE can partially recover computational signals in deep quantum circuits under simulated hardware noise, suggesting the potential combined error mitigation techniques for improving the reliability of near-term quantum algorithms without active quantum error correction.

•Nov 13, 2026•0 citations

Implementation of a quantum search algorithm on a quantum computer

Jonathan A. Jones, Michele Mosca, Rasmus H. Hansen

arXiv:quant-ph/9805069•Nature•May 1, 1998•553 citations

Implementation Grover’s search algorithm on IBM Eagle r3

Hong Luu Thu, Ninh Nguyen Duy

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.

Journal of Military Science and Technology•Nov 25, 2024•0 citations
Grover’s quantum search algorithm delivers quadratic speedup over classical counterparts for finding an item in unstructured database. But the accuracy of the algorithm degrades as the number of qubits are increased. Noises of various types affect the accuracy of the Grover’s algorithm. The imperfect measurement on the qubit results in measurement errors appears to be one of the factors which limit the scalability of near-term quantum devices/algorithms. This paper is focused on the implementation of measurement error mitigation technique on Grover’s algorithm up to 4-qubits. The measurement error mitigation model for Grover’s algorithm is developed and implemented on the real-time quantum computer. The accuracy of Grover’s algorithm up to 4-qubits with and without measurement errors is evaluated and compared. The results indicate that measurement error mitigation technique mitigates the measurement errors of the Grover’s algorithm and improves its accuracy.
Quantum computers have the potential to address computational problems beyond the practical capabilities of classical systems, but Noisy Intermediate-Scale Quantum (NISQ) processors remain limited by errors that accumulate during circuit execution. Quantum Error Mitigation (QEM), particularly Zero-Noise Extrapolation (ZNE), offers a way to reduce these errors without requiring additional physical qubits. However, ZNE has been studied extensively in relatively small or shallow circuits, leaving its effectiveness in deep, non-variational algorithms less explored. This project investigates whether combining readout mitigation and ZNE can mitigate errors in a deep, six-qubit Grover's search algorithm. The circuit was compiled onto IBM's 133-qubit FakeTorino simulated backend, reaching a depth of 1,118 and containing 369 entangling gates. Under simulated noise, the unmitigated probability of measuring the target state was 3.36%, compared with a uniform random-guessing probability of 1.5625%. Digital unitary gate folding and readout error mitigation were subsequently applied across four progressively increased noise-scaling sets (S1–S4), and scale factors. Four extrapolation models (Linear, Quadratic, Poly-Exponential, and Padé) were evaluated. The Poly-Exponential model achieved the highest average target-state probability, reaching 6.91% at S4, approximately 2.06 times the unmitigated probability. These results demonstrate that combining readout mitigation with ZNE can partially recover computational signals in deep quantum circuits under simulated hardware noise, suggesting the potential combined error mitigation techniques for improving the reliability of near-term quantum algorithms without active quantum error correction.
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.