Sign inSign in

Grover's algorithm

A quantum algorithm that solves the unstructured search problem (finding a 1 among N bits) in square root of N queries.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 7 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 0:09Grover's Algorithm
    • 33:28Rotate, Compute, Rotate
    • 7:55Quantum Algorithms Synthesis II: Grover's Search & Circuit SAT
  • Christof Paar

    Ruhr University Bochum · Undergraduate

    A quantum algorithm that provides a quadratic speedup for unstructured search problems, effectively halving the effective key length of symmetric ciphers.
    • 8:10Introduction to Hash-based Post-quantum Cryptography (PQC)
  • Andrew Helwer

    Microsoft Research · Undergraduate

    An algorithm that can search an unordered list in square root n time.
    • 2:12Quantum Computing for Computer Scientists
  • Kate Smith-Miles

    University of Melbourne · Graduate

    A quantum algorithm that simultaneously considers all possible solutions and scales as the square root of the search space size.
    • 17:49AI in Science and Engineering: Towards Trustworthy AI and Quantum Technologies

Lectures that assume it

3

Connections

19

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.