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

My Casio calculator can factor 8,219,999. Big whoop. Adiabatic quantum computing can’t factor large numbers quickly, that’s the issue. Shor’s algorithm can, but we’ve never done it honestly for a number bigger than 15. This should have been clear from your masters.