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

IEEE Congress on Evolutionary Computation (CEC)

Quantum mechanical searching

Lov K. Grover

Published Jan 20, 2003• 26 citations
Publisher

Abstract

It has recently been shown that the searching speed of computers based on quantum mechanics is far superior to their classical counterparts.
DOI
10.1109/cec.1999.785555

Related papers

Quantum Computer Search Algorithms: Can We Outperform the Classical Search Algorithms?

Avery M. Leider, Sadida Siddiqui, Daniel A. Sabol +1 more

Advances in intelligent systems and computing•Oct 12, 2019•5 citations

Quantum computation

Lov K. Grover

As device structures get smaller quantum mechanical effects predominate. About twenty years ago it was shown that it was possible to redesign devices so that they could still carry out the same functions. Recently it has been shown that the processing speed of computers based on quantum mechanics is indeed far superior to their classical counterparts for some important applications. This paper introduces quantum mechanics and shows how this can be used for computation.

IEEE Potentials•Jan 1, 1999•7 citations

Quantum mechanics can find a needle in a haystack every time

F. Mohit, Joshua J. Guanzon, Jaden McKinlay +5 more

Grover's algorithm is one of the pioneering demonstrations of the advantages of quantum computing over its classical counterpart, providing - at most - a quadratic speed-up over the classical solution for unstructured database search. The original formulation of Grover's algorithm is non-deterministic, finding the answer with a probability that varies with the size of the search space and the number of marked elements. A recent reformulation introduced a deterministic form of Grover's algorithm that - in principle - finds the answer with certainty. Here we realise the deterministic Grover's algorithm on a programmable photonic integrated circuit, finding that it not only outperforms the original Grover's algorithm as predicted, but is also markedly more robust against technological imperfections. We explore databases of 4 to 10 elements, with every choice of a single marked element, achieving an average success probability of $99.77 \pm 0.05\%$.

arXiv:2506.06435•Jun 6, 2025•0 citations

Quantum computing and quantum search algorithms

Zijian Diao, Goong Chen

•Jan 1, 2001•0 citations

FROM THE QUBIT TO THE QUANTUM SEARCH ALGORITHMS

Gianfranco Cariolaro, Tommaso Occhipinti

•Dec 1, 2007•0 citations

Quantum Computing And Data Mining Recent Advancements: A Review

Mohammad Javad Shayegan, Arash Janati

A significant amount of interest has been generated in recent years in the convergence of quantum computing and data mining due to quantum algorithms' potential to revolutionize information extraction from vast datasets, as well as their ability to utilize quantum principles and natural capabilities to perform far more efficiently and efficiently than classic algorithms. We provide a comprehensive and detailed review of the current state of quantum computing algorithms in the field of data mining and machine learning, highlighting key developments, challenges, and their implementation. In particular, machine learning can benefit from QC mechanics like superposition and entanglement due to the use of q-bits as well as other superior advantages provided by quantum computing, such as Grover algorithm. It is important to note that classic machine learning models differ in terms of the types of learning, prediction models, and operating on data as well as performance over time, along with their counterparts, such as supervised and unsupervised models, which are naturally more sophisticated. Our review will also discuss how integrating and merging the two fields of machine learning and quantum computing, and their mechanics, will affect the aspect of time and resource

International Conference on Web Research (ICWR)•Apr 24, 2024•1 citation
Grover's algorithm is one of the pioneering demonstrations of the advantages of quantum computing over its classical counterpart, providing - at most - a quadratic speed-up over the classical solution for unstructured database search. The original formulation of Grover's algorithm is non-deterministic, finding the answer with a probability that varies with the size of the search space and the number of marked elements. A recent reformulation introduced a deterministic form of Grover's algorithm that - in principle - finds the answer with certainty. Here we realise the deterministic Grover's algorithm on a programmable photonic integrated circuit, finding that it not only outperforms the original Grover's algorithm as predicted, but is also markedly more robust against technological imperfections. We explore databases of 4 to 10 elements, with every choice of a single marked element, achieving an average success probability of 99.77±0.05%99.77 \pm 0.05\%99.77±0.05%.
A significant amount of interest has been generated in recent years in the convergence of quantum computing and data mining due to quantum algorithms' potential to revolutionize information extraction from vast datasets, as well as their ability to utilize quantum principles and natural capabilities to perform far more efficiently and efficiently than classic algorithms. We provide a comprehensive and detailed review of the current state of quantum computing algorithms in the field of data mining and machine learning, highlighting key developments, challenges, and their implementation. In particular, machine learning can benefit from QC mechanics like superposition and entanglement due to the use of q-bits as well as other superior advantages provided by quantum computing, such as Grover algorithm. It is important to note that classic machine learning models differ in terms of the types of learning, prediction models, and operating on data as well as performance over time, along with their counterparts, such as supervised and unsupervised models, which are naturally more sophisticated. Our review will also discuss how integrating and merging the two fields of machine learning and quantum computing, and their mechanics, will affect the aspect of time and resource