Shor's algorithm is often used as the argument. It can solve the factorization problem faster than any known algorithm for classical computers. Yet, we have no proof classical computers can't also factor integers efficiently.
Is there any actual proof quantum computers can solve some problems faster than classical computers?