BQP
Description: BQP is the computational complexity class of decision problems solvable by a quantum computer with bounded error in polynomial time.
Primary topic: Quantum Computing Algorithms and Architecture (72%)
Wikidata ID: wiki/Q601325
OpenAlex ID: keywords/bqp
