Many quantum algorithms can be iterated to find a solution with arbitrarily high probability. For example, Grover's algorithm has an amplification step, and Sho

Many quantum algorithms can be iterated to find a solution with arbitrarily high probability. For example, Grover's algorithm has an amplification step, and Shor's algorithm can be repeated (with a different seed guess) creating a new solution with roughly independent probability.