Focus beyond quadratic speedups for error-corrected quantum advantage — mentioned by fastneutron

Sat, 15 Jul 2023 14:23:50 GMT

In principle, the advantages of quantum computers are delivered not in speed or throughput, but in algorithmic scaling. For example, the well-known Grover's search algorithm scales as O(sqrt(N)), as opposed to O(n) for classical linear search. Similarly, Shor's factoring algorithm comes with an exponential scaling speedup, taking a nominally O(2^n) problem and bringing it to O(n^k). Problems related to physics and chemistry simulations are falling in various places along that quadratic-to-exponential speedup spectrum as well. In practice, there's expected to be a larger constant overhead than…

Paper and discussion history. A mention is not an endorsement.

Focus beyond quadratic speedups for error-corrected quantum advantage · HackerPapers discussions

Focus beyond quadratic speedups for error-corrected quantum advantage — mentioned by fastneutron