BQP complexity class

E2112333 UNEXPLORED

The BQP complexity class consists of all decision problems that can be efficiently solved with bounded error by a quantum computer, serving as the quantum analogue of the classical class BPP.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
BQP complexity class canonical	1

Referenced by (1)

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

Quantum Computing Since Democritus → topic → BQP complexity class ⓘ