ConceptTheory & Algos
Grover's algorithm with multiple solutions
A variation of Grover's search algorithm where finding one of multiple matching items takes fewer queries than the standard square root of N bound.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.