Shor's algorithm is the quintessential example, but there are other algorithms (mostly graph algorithms) that are NP and hard would be very efficient on a quantum computer.