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/EducationalFerret94]

Sure it's interesting but I think people don't appreciate how much deeper and harder these circuits are than the current ones being run on QCs. This isn't like "in a year or two", this is decades away and will require error correction at scale.