There are several categories of computational problems where quantum computers will be able to solve at better computational complexity compared to classical co

There are several categories of computational problems where quantum computers will be able to solve at better computational complexity compared to classical computers. One famous example would be Shor's algorithm. It's considered to be a practical threat to many public key cryptography depending on integer factorization being hard.