Quantum computing, Shor’s algorithm, and you.

Scott Aaronson’s blog is packed with a wealth of good stuff on quantum informatics.

The blog’s subtitle, Quantum computers are not known to be able to solve NP-complete problems in polynomial time , says it all, really, especially in regards to debunking the wealth of misunderstanding out there that surrounds quantum computing.

This post, accurately explaining Shor’s algorithm, perhaps the most famous of all quantum algorithms, in completely accessible language, is really good, and I recommend it.

Advertisements

About this entry