Sign inSign in

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.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 3 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

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    An algorithm that uses the Hadamard transform to test if a Boolean function's bias is non-zero or zero.
    • 12:26Quantum Algorithms Synthesis I: The Hadamard Transform
  • Allan Adams

    MIT · Undergraduate

    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.
    • 51:22Entanglement: Quantum Computing, EPR, and Bell's Theorem

Connections

9

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

2 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.