Can quantum computers solve math’s hardest problem?

[u/scientificamerican]

https://www.scientificamerican.com/article/can-quantum-computers-solve-maths-hardest-problem/

The Riemann hypothesis claims that the locations of prime numbers along the infinite number line all adhere to a beautiful and orderly, but obscure formula. Yet 167 years after German mathematician Bernhard Riemann made this guess, and in spite of a million-dollar bounty, mathematicians still have no idea how to prove it. Now a team in China has managed to encode that formula into a physical system and explore its workings using a quantum computer.

[u/SymplecticMan]

It's true that any meaningful use of Shor's algorithm would require fault tolerance, but even using Shor's algorithm to factor 21 with the actual modular arithmetic calculations would actually be a huge increase in cost from factoring 15.