ConceptTheory & Algos
BQP to PP containment
The theorem states that BQP is contained within PP, meaning problems solvable in polynomial time by a quantum computer can also be solved by a probabilistic Turing machine in polynomial time with slightly better than 50/50 success probability.
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
2The lectures that define it or assume it, and the concepts next to it.