BQP

Aristotree

/darko/Quantum computing

Sign up free

136nodes240relationshipsrels

BQP. 2 connected concepts: Grover's algorithm (related to), Shor's algorithm (related to).

100%

Community · Grover's algorithm

Summary

In computational complexity theory, bounded-error quantum polynomial time (BQP) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances.

35 words

SourcesWikipedia

Connections2

Complexity class membership
Grover's algorithm belongs to the BQP complexity class, which contains problems efficiently solvable by a quantum computer.
SourcesWikipedia Wikidata Wikipedia Wikidata
complexity class containing Shor's algorithm
Shor's algorithm is a primary example of an algorithm that resides in BQP (Bounded-error Quantum Polynomial time) but is not known to be in P.
SourcesWikipedia Wikidata Wikipedia Wikidata

Facts