BQP (Bounded-Error Quantum Polynomial-Time)

• BQP is a type of complexity class of decision problems solvable by a quantum Turing machine in polynomial time, with an error probability of at most 1/3 for all instances
• BQP is the quantum analog to the complexity class BPP

Resources

• https://en.wikipedia.org/wiki/BQP