Lattice-based cryptography (https://en.wikipedia.org/wiki/Lattice-based_cryptography) is currently believed to be quantum-computer resistant (i.e. requires super-polynomial time to break even on a sufficiently large quantum computer).

There are only very few problems were quantum computers achieve an exponential speedup vs. classical computers, factoring being one example.