Re:Google tries out error correction on its quantum processor
by tylerhou on Friday July 16, 2021 @10:01AM
(#27856289)
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.
Is this theoretically likely to give near certain probability to the right answer on large problems or will it be affected by local minimums and what not?
Is that the issue with scale? That noise propagates through the system and renders the uplift in problem solving moot?