ConceptTheory & Algos
Deutsch-Jozsa algorithm
A deterministic quantum algorithm that distinguishes whether a boolean function is constant or balanced with a single query, providing an exponential speedup over classical deterministic algorithms.
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
2Each in their own terms, from the easiest level.
Ryan O'Donnell
An algorithm that uses the Hadamard transform to test if a Boolean function's bias is non-zero or zero.Allan Adams
A series of rules for how to make a quantum mechanical system evolve so as to effect a calculation you wanted to compute with fewer evaluations than classically possible.
Connections
9The lectures that define it or assume it, and the concepts next to it.