BQP

E2112327 UNEXPLORED

BQP (Bounded-Error Quantum Polynomial Time) is the class of decision problems efficiently solvable by a quantum computer with error probability bounded away from 1/2.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
BQP canonical	3

Referenced by (3)

Full triples — surface form annotated when it differs from this entity's canonical label.

BQP vs. the Polynomial Hierarchy → topic → BQP ⓘ

BQP vs. the Polynomial Hierarchy → concernsClass → BQP ⓘ

Limits on Efficient Computation in the Physical World → topic → BQP ⓘ