BQP

BQP can also be viewed as a bounded-error uniform family of quantum circuits. A language L is in BQP if and only if there exists a polynomial-time uniform family of quantum circuits, such that

  • For all, takes n qubits as input and outputs 1 bit
  • For all x in L,
  • For all x not in L,

Read more about BQP:  Quantum Computation, Relationship To Other Complexity Classes