Feeds

* Posts by habilain

1 post • joined 5 May 2011

Oz boffins in quantum computing breakthrough

habilain
Unhappy

Maths, tsk, tsk...

"factoring very large prime numbers" is really easy. Any prime has 2 factors, 1 and itself, regardless of its size. I think you mean either testing very large numbers for prime-ness or factoring a large number into primes - both of which quantum computers should be good at.

4
0