SmartAnswer
Smart answer:
After reading 2112 websites, we found 5 different results for "What is the first quantum algorithm to show exponential speedup"
Simon's algorithm
The first quantum algorithm to offer an exponential speedup (in the query complexity setting) over classical algorithms was Simon's algorithm for identifying a hidden exclusive-or mask.
Source links:
ShareAnswer
Confidence Score
Simon's algorithm for identifying a hidden exclusive-or mask
The first quantum algorithm to offer an exponential speedup (in the query complexity setting) over classical algorithms was Simon's algorithm for identifying a hidden exclusive-or mask.
Source links:
ShareAnswerConfidence Score
the Deutsch–Jozsa algorithm, one of the first examples of a quantum algorithm that is exponentially faster than any possible deterministic classical algorithm
1992 – David Deutsch and Richard Jozsa develop the Deutsch–Jozsa algorithm, one of the first examples of a quantum algorithm that is exponentially faster than any possible deterministic classical algorithm.
Source links:
ShareAnswer
Confidence Score
The Bernstein–Vazirani algorithm
The Bernstein–Vazirani algorithm is the first quantum algorithm that is exponentially more efficient than classical algorithms.
Source links:
ShareAnswerConfidence Score
the least-square quantum support vector machine ( LS-QSVM)5
One of the first quantum algorithms exhibiting an exponential speed-up capability is the least-square quantum support vector machine (LS-QSVM)5.
Source links:
ShareAnswer
Confidence Score