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

European Journal of Operational Research

Speeding up Grover’s algorithm

Stefan Creemers

Published Mar 7, 2025• 7 citations
Publisher
DOI
10.1016/j.ejor.2025.02.034

Related papers

An information-theoretic analysis of Grover's algorithm

Erdal Arıkan

Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately square-root of N queries to a quantum oracle, thus achieving a square-root speed-up over classical algorithms. We present an information-theoretic analysis of Grover's algorithm and show that the square-root speed-up is the best attainable result using Grover's oracle.

arXiv:quant-ph/0210068•Oct 10, 2002•5 citations

Grover’s Algorithm

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooks•Jan 1, 2023•2 citations

Speeding up the Grover algorithm using auxiliary solutions

Anwar Y. Shiekh

It may be possible to extend the Grover search algorithm by taking a divide and conquer approach using auxiliary solutions to achieve an exponential speed-up.

arXiv:0906.4804•Jun 26, 2009•0 citations

Reassessing Grover's Algorithm.

Scott R. Fluhrer

•Jan 1, 2017•7 citations

Grover’s Algorithm: I

Hiu Yung Wong

Springer eBooks•Jun 21, 2023•0 citations

Quantifying computational advantage of Grover’s algorithm with the trace speed

Valentin Gebhart, Luca Pezzè, Augusto Smerzi

Despite intensive research, the physical origin of the speed-up offered by quantum algorithms remains mysterious. No general physical quantity, like, for instance, entanglement, can be singled out as the essential useful resource. Here we report a close connection between the trace speed and the quantum speed-up in Grover's search algorithm implemented with pure and pseudo-pure states. For a noiseless algorithm, we find a one-to-one correspondence between the quantum speed-up and the polarization of the pseudo-pure state, which can be connected to a wide class of quantum statistical speeds. For time-dependent partial depolarization and for interrupted Grover searches, the speed-up is specifically bounded by the maximal trace speed that occurs during the algorithm operations. Our results quantify the quantum speed-up with a physical resource that is experimentally measurable and related to multipartite entanglement and quantum coherence.

arXiv:2001.04486•Scientific Reports•Jan 14, 2021•13 citations
Despite intensive research, the physical origin of the speed-up offered by quantum algorithms remains mysterious. No general physical quantity, like, for instance, entanglement, can be singled out as the essential useful resource. Here we report a close connection between the trace speed and the quantum speed-up in Grover's search algorithm implemented with pure and pseudo-pure states. For a noiseless algorithm, we find a one-to-one correspondence between the quantum speed-up and the polarization of the pseudo-pure state, which can be connected to a wide class of quantum statistical speeds. For time-dependent partial depolarization and for interrupted Grover searches, the speed-up is specifically bounded by the maximal trace speed that occurs during the algorithm operations. Our results quantify the quantum speed-up with a physical resource that is experimentally measurable and related to multipartite entanglement and quantum coherence.