Exponential speedup refers to the dramatic improvement in computational efficiency, where the time complexity of solving a problem is reduced from an exponential function of the input size to a polynomial or logarithmic function. This is often associated with quantum computing, where algorithms like Shor's algorithm can solve certain problems exponentially faster than the best-known classical algorithms.