Spintronics or magnetoelectronics don’t necessarily have anything to do with quantum computing – they do exploit a characteristic of electrons that’s of a quantum nature, its spin (but then, so do ordinary computers – charge is as much a quantum number as spin is), but do so entirely within a classical computational paradigm, i.e. an electron in a spintronic system is always treated as having a definite ‘spin up’ or ‘spin down’ state, encoding a 0 or 1 bit.
Quantum computation takes its power from exploiting the (purely quantum) possibility of having a system not residing in a definite state, but rather in a superposition of states – i.e. the electron is not either in state ‘spin up’ or ‘spin down’, but rather in a state that in some sense contains both possibilities, and only (or so most quantum ontologies would have you believe) upon measurement is forced to decide for one or the other possibility.
The popular gloss is that the quantum computer uses this capacity to ‘explore’ all possible computational paths to arrive at a solution (i.e. if you have the problem of factoring a large number, the computer ‘tries out’ all possible factors simultaneously, rather than one by one), to then ‘decide’ on the correct one.
It’s easy to see the difference between a quantum and a classical computer: a classical bit can be in either the state 0 or 1, respectively; two bits can be in one of 2[sup]2[/sup] = 4 (00, 01, 10, 11) states, three bits in one of 2[sup]3[/sup] = 8 bits and so on – in general, a classical computer with n bits can occupy one of 2[sup]n[/sup] states at any one time. A quantum bit (‘qubit’), however, is not so limited: rather than existing either in state 0 or 1, it can be in both states, simultaneously; this means that an n qubit quantum computer can be in any arbitrary superposition of 2[sup]n[/sup] states.
This is how David Deutsch, one of the most well-known researchers in the field, likes to frame it. However, this depends on the truth of one particular interpretation of quantum mechanics, the many-worlds interpretation due to Hugh Everett. There is controversy about which of the known interpretations of QM, if any, is the correct one, and at present, I believe it is still the case that most practitioners subscribe to the so-called Copenhagen interpretation; consequently, there is considerable disagreement about whether or not there are in fact multiple universes, and it is possible to give a coherent account of quantum computation without referring to them.
That’s not really right. In principle, every quantum computation can be reduced to just measuring a prepared system in the right basis to obtain the correct result; however, in general, this basis isn’t known. So effectively, most known quantum algorithms give the right answer only with a certain probability, and one has to repeat the computation in order to get appreciable statistics on what result is the correct one. Also, I’m not sure what you intend your example to mean – if I just thought up a number between 1 and 100, a quantum computer couldn’t do any better than a classical one in guessing the right one.
Why’s this in Cafe Society, by the way?