Linked by Thom Holwerda on Wed 7th Sep 2005 11:56 UTC
Thread beginning with comment 28102
To view parent comment, click here.
To read all comments associated with this story, please click here.
To view parent comment, click here.
To read all comments associated with this story, please click here.





Member since:
"What gives it away is the clock speed,
way too slow.."
Actually, it's my understanding that for "linear" functions (most of what a computer does, basic math & hardware controll), quantum computing would be pressed to keep up with a top line pentium. It's the "non-linear" math ("take this huge number, see if it factors into any large prime numbers") that quantum computing's "wooga-wooga" properties come in and it becomes blazingly fast. Quantum computing can "test" numerous values simultaneously, so it's ideal for situations where you have to use trial and error in a brute force attempt. For math that doesn't require this, like balancing a spreadsheet (the computer doesn't have to guess the sum of a column by brue force, it just adds them), you're down to base clockspeed, and you loose all benefits.
Mike K.