This repository has been archived on 2023-07-05. You can view files and clone it, but cannot push or open issues/pull-requests.
notes/Machine Tips (Quantum)/Resources/Algorithms/Alg Collection/Grover's Search Algorithm.md

622 B
Raw Permalink Blame History

Grovers Algorithm

Grovers algorithm is a search algorithm initially developed for unstructured data. It can also be described in terms of an oracle, which is a function with some promise or property that can be evaluated as many times as we want, and our goal is to determine the property that the function has.

Search algorithm that can produce amazing results for the unstructured search problem found in computer science. The classical 3-SAT NP problem can be solved with quantum computers with a significant speedup time. 

  • a fantastic Medium article that explains how Grover's search works with Qisket