ConceptTheory & Algos
Bounded-error quantum polynomial-time
BQP is the complexity class of all decision problems such that for all input lengths there exists a quantum circuit that solves with probability at least 3/4 for yes instances and at most 1/4 for no instances.
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.