Quantum Computing Explained! (Well, Sorta)
An anonymous reader writes "Valiant effort to 'explain' quantum computing over on silicon.com — covering the difference between classical computers and quantum machines."
← Back to Stories (view on slashdot.org)
Have to agree with the comments above, that article is pretty useless.
Coincidentally, though, at a university book sale a few weeks ago, I picked up a copy of N. David Mermin's Quantum Computer Science: An Introduction, for just $5 (seems to be about $30 on Amazon) and I can't recommend it highly enough. It's an intro to quantum computing textbook, about 200 pages, written specifically for people who have CS or math (as opposed to physics) backgrounds, and while it's almost impossible to get into the nitty-gritty of why quantum computing works without a lot of quantum mechanics esoterica, this book does a great job of explaining how it works (which is plenty complicated on it's own).
It's not a light read (it's a textbook, after all), and contains some serious math, but it's nothing someone with a college education can't handle and it really helped me understand this whole mess better than any popular news article.
Dislike the Electoral College? Lobby your state to join the National Popular Vote Interstate Compact.
Tip to new writers: you aren't witty, you aren't funny, you aren't entertaining. Leave your antics out of the writing and cover the subject matter so well that its inherent nature will be interesting to the reader.
The set of problems you can in principle solve with a quantum computer is exactly the same as you can solve with classical computers. The best proof of this is that you can simulate a quantum computer with a classical computer (and vice versa). However, as far as we know you cannot simulate a quantum computer on a classical computer in polynomial time.
The Tao of math: The numbers you can count are not the real numbers.