Variational Quantum Algorithms

[@schmetterling4477]

The idea that quantum computers are significantly better at search than classical algorithms seems to have already been mathematically disproven.

[@sd1729]

Could you tell us the reference/source?

[@schmetterling4477]

@@sd1729 The speedup for unstructured search goes from O(n) to O(sqrt(n)). This means that problems with exponential search space stay problems with exponential search space. This is a rather old result from the late 1990s, I believe.

[@sd1729]

@@schmetterling4477 Thanks.