Prime factorization is one. Another is an asymptotically faster Fourier transform.

There are several tricks in signal processing that have faster analogs in a quantum implementation. Those cool tricks are the foundation of much more complicated transformations and algorithms.

There is an entire complexity class you can read up in: Bounded Quantum Polynomial Time (BQP).