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

arXiv:quant-ph/0202176

Grover's search algorithm and the quantum measurement problem

Manoj K. Samal, Partha Ghose

Published Feb 28, 2002• 0 citations
arXivHTMLPDF

Abstract

It is suggested that the individual outcomes of a measurement process can be understood within standard quantum mechanics in terms of the measuring apparatus, treated as a quantum computer, executing Grover's search algorithm.
DOI
10.48550/arxiv.quant-ph/0202176

Related papers

The Measurement Based Quantum Computing Search Algorithm is Faster than Grover's Algorithm

A. Matthew Smith, Paul M. Alsing

We find that the Measurement Based Quantum Computing (MBQC) search algorithm on an unsorted list is not the same as Grover's search algorithm (GSA).

arXiv:1211.3405•Nov 14, 2012•1 citation

Beyond Factorization and Search

Lov K. Grover

Recent theoretical developments have driven the search for computers based on the unusual rules of quantum mechanics. In his Perspective, Grover reviews the progress in theoretical quantum computing, with particular focus on search algorithms and applications to difficult computational problems.

Science•Aug 7, 1998•11 citations

Grover’s Algorithm for Data Lake Optimization Queries

Mohamed Cherradi, Anass El Haddadi

Now-a-days, the use of No-SQL databases is one of the potential options for storing and processing big data lakes. However, searching for large data in No-SQL databases is a complex and time-consuming task. Further, information retrieval from big data management suffers in terms of execution time. To reduce the execution time during the search process, we propose a fast and suitable approach based on the quantum Grover algorithm, which represents one of the best-known approaches for searching in an unstructured database and resolves the unsorted search query in O (√n) time complexity. To assess our proposal, a comparative study with linear and binary search algorithms was conducted to prove the effectiveness of Grover's algorithms. Then, we perform extensive experiment evaluations based on ibm_qasm_simulator for searching one item out of eight using Grover’s search algorithm based on three qubits. The experiments outcomes revealed encouraging results, with an accuracy of 0.948, well in accordance with the theoretical result. Moreover, a discussion of the sensitivity of Grover's algorithm through different iterations was carried out. Then, exceeding the optimal number of iterations round (π/4 √N), induces low accuracy of the marked state. Furthermore, the incorrect selection of this parameter can outline the solution.

International Journal of Advanced Computer Science and Applications•Jan 1, 2022•4 citations

Analysis of Grover’S Quantum Search Algorithm on a Classical Computer

Necati Çeli̇k, Özkan Bingöl

•Jan 1, 2022•0 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, 2025•0 citations

Quantum search algorithms

Andris Ambainis

We review some of quantum algorithms for search problems: Grover's search algorithm, its generalization to amplitude amplification, the applications of amplitude amplification to various problems and the recent quantum algorithms based on quantum walks.

arXiv:quant-ph/0504012•ACM SIGACT News•Jun 1, 2004•193 citations
Now-a-days, the use of No-SQL databases is one of the potential options for storing and processing big data lakes. However, searching for large data in No-SQL databases is a complex and time-consuming task. Further, information retrieval from big data management suffers in terms of execution time. To reduce the execution time during the search process, we propose a fast and suitable approach based on the quantum Grover algorithm, which represents one of the best-known approaches for searching in an unstructured database and resolves the unsorted search query in O (√n) time complexity. To assess our proposal, a comparative study with linear and binary search algorithms was conducted to prove the effectiveness of Grover's algorithms. Then, we perform extensive experiment evaluations based on ibm_qasm_simulator for searching one item out of eight using Grover’s search algorithm based on three qubits. The experiments outcomes revealed encouraging results, with an accuracy of 0.948, well in accordance with the theoretical result. Moreover, a discussion of the sensitivity of Grover's algorithm through different iterations was carried out. Then, exceeding the optimal number of iterations round (π/4 √N), induces low accuracy of the marked state. Furthermore, the incorrect selection of this parameter can outline the solution.
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.