Construct · 1 fields · 1 citations

BQP: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Theory of computation

the class of decision problems a quantum computer can solve in polynomial time with error probability bounded away from one half.

In theory of computation, BQP refers to the class of decision problems a quantum computer can solve in polynomial time with error probability bounded away from one half. This meaning comes from Bernstein (1997) in SIAM Journal on Computing.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how BQP sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

class3 fields · 3 citationsjingle · one word, three constructs error4 fields · 8 citationsjingle · one word, four constructs quantum4 fields · 7 citationsjingle · one word, four constructs

References

Bernstein, E., & Vazirani, U. (1997). Quantum Complexity Theory. SIAM Journal on Computing, 26(5), 1411-1473. https://doi.org/10.1137/s0097539796300921

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct