Page "BQP" Paragraph 2
from
Wikipedia
In other words, there is an algorithm for a quantum computer ( a quantum algorithm ) that solves the decision problem with high probability and is guaranteed to run in polynomial time.
On any given run of the algorithm, it has a probability of at most 1 / 3 that it will give the wrong answer.
Page 1 of 1.
1.960 seconds.