Quantum Computing Explained! (Well, Sorta) 145
An anonymous reader writes "Valiant effort to 'explain' quantum computing over on silicon.com — covering the difference between classical computers and quantum machines."
So you think that money is the root of all evil. Have you ever asked what is the root of money? -- Ayn Rand
chatty narrative (Score:4, Insightful)
Re:Weird thing about the article (Score:5, Insightful)
But by observing the article, you're changing it. Does that mean it will explain it to you...but not to me? :)
Horrible (Score:5, Insightful)
Sorry to be so negative but in my opinion the article is horrible. It doesn't explain anything unless you think bad analogies and jovial metaphors help you understand things better. After having read it, I don't know a single qubit more about quantum computers than before.
Re:Wrong atomic picture in TFA (Score:3, Insightful)
It's also a picture of an atom that doesn't exist. Never mind that the electrons are enormous and have circular orbits. There are 2 of one kind of nucleon and 3 of the other kind, with 4 electrons that all seem to be in the same shell.
So, the two possible atoms are Lithium-5 (-1) or Helium-5 (-2). Both Lithium-5 and Helium-5 are highly unstable. Both of them should have two electrons in one shell and two in higher-energy shell. The -2 state of helium would be challenging to produce, to say the least.
Re:Are quantum computers Turing machines? (Score:3, Insightful)
Quantum computers only offer better speeds; a quantum computer can always be simulated by a classical computer. However, storage and run time of the simulation grows exponentially with the size of the quantum computer being simulated, so this is not feasible in practice.
The reverse is also true. A quantum computer (when/if built) will be able to run any classical algorithm, since it's possible to implement a classical NAND gate using quantum gates. It'd be a huge waste, however, to use quantum gates this way.
Re:One major mistake (Score:3, Insightful)