It looks like you're using an Ad Blocker.
Please white-list or disable AboveTopSecret.com in your ad-blocking tool.
Some features of ATS will be disabled while you continue to use an ad-blocker.
Originally posted by bismarcksea
reply to post by buddha
Being Irish, I don't appreciate the Racial Slur.
It is important to note that a quantum computer will not necessarily outperform a classical computer at all computational tasks. Multiplication for example, will not be performed any quicker on a quantum computer than it could be done on a similar classical computer. In order for a quantum computer to show its superiority it needs to use algorithms that exploit its power of quantum parallelism. Such algorithms are difficult to formulate, to date the most significant theorised being Shor's algorithm and Grover's algorithm. By using good these algorithms a quantum computer will be able to outperform classical computers by a significant margin. For example, Shor's algorithm allows extremely quick factoring of large numbers, a classical computer can be estimated at taking 10 million billion billion years to factor a 1000 digit number, where as a quantum computer would take around 20 minutes.