Want to read Slashdot from your mobile device? Point it at m.slashdot.org and keep reading!


Forgot your password?

Submission + - Solve The Riemann Hypothesis With A Quantum Computer (i-programmer.info)

mikejuk writes: A new quantum algorithm allows the computation of a range of prime number functions to be computed well beyond the limits of a conventional computer. It is even possible that it could solve the million-dollar Riemann hypothesis. The best known of the prime number functions is Pi(x) which gives the number of primes smaller than or equal to x and we currently only know its value up to 10^24, By preparing a quantum state consisting of an entanglement of the primes José Latorre of the University of Barcelona in Spain, along with Germán Sierra of the Autonomous University of Madrid can compute Pi(x) an many other functions very quickly. As well as providing information on the distribution of the primes, a fundamental, it could also disprove the Riemann hypothesis as this predicts how close Pi(x) should be to its best approximation. The good news is that while real world tasks such as factoring needs a 1000 qubit machine only 80 qubits are needed to go beyond conventional computation.
This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

Solve The Riemann Hypothesis With A Quantum Computer

Comments Filter:

I've noticed several design suggestions in your code.