Sign inSign in

Bounded-error quantum polynomial-time

BQP is the complexity class of all decision problems ϕ\phi such that for all input lengths nn there exists a quantum circuit CnC_n that solves ϕ\phi with probability at least 3/4 for yes instances and at most 1/4 for no instances.
as Ryan O'Donnell defines itCarnegie Mellon University
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.

Lecturers

1

    Connections

    3

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

    Concepts2

    Lecture1

    1 lecturer. 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.