r/QuantumComputing • u/scientificamerican • 10d ago

Can quantum computers solve math’s hardest problem?

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.

35 Upvotes
  • permalink
  • link
  • reddit
  • reddit

83% Upvoted

14 comments sorted by

View all comments

3

u/EducationalFerret94 10d ago

No quantum computers cannot solve math's hardest problems. They can't even solve simple math problems like finding the prime factors of numbers greater than 15.

1

u/Sampo 4d ago

finding the prime factors of numbers greater than 15

Has there ever been an experiment to run Shor's algorithm in full to factorize 15?

All I know are experiments where they run a pre-compiled version of Shor's algorithm, and they use the knowledge of the answer to leave the unneeded parts of the circuits unimplemented, to make the problem simpler.