Sign inSign in

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

BQP complexity class1PP complexity class1Quantum circuits1

Lecturers

1

    Connections

    2

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

    Concept1

    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.