Not exactly, 300 bits is 600 possible states (either a zero or a one x 300). I believe you mean permutations, in which it would be 2^300, a much larger number.

So basically, as I understand it, a quantum computer produces as many “states” as a classical computer produces permutations.

– Greg

]]>“300 regular bits results in 600 possible states (2 x 300), ”

That should be 300^2 = 90,000 possible states.

]]>That’s an excellent point. I was recently talking to Charlie Bennett, one of the key figures in quantum information theory and he made the point that one of the most important issues is that we have to figure out how to apply quantum computing to classical problems and still have them perform faster than classical computers.

That’s still a ways off.

– Greg

]]>A thought on the possibility you suggested regarding users using different models /configurations of quantum computers for differing tasks.

If you look at how today’s conventional computers evolved, the earliest computers were analog machines that had to be configured for specific tasks. In fact, they had to be reset every time they were used – a feature that inadvertently led to the advancement of chaos theory.

It took quite some time for digital computer systems as we know them today to evolve. The advances in technology that made that possible allow a broad based computer that allows us to do a multitude of things with one machine.

While quantum computing may begin the same way, it’s possible it will evolve similarly.

]]>