# 0, 1, superposition

Doh, quantum computers are tristate logic devices?

In classical computer science, bits — or binary digits — hold data encoded as ones and zeros. In quantum computing, data is measured in qubits, or quantum bits. As such, a qubit can have three possible states — one, zero or a “superposition” of one and zero.

I mean technically it is correct, I guess (ignorning mixed states), but doesn’t this make it sound like qubits are just three state classical systems? Or is my nitpicky-meter too high?

This entry was posted in Computer Science, Quantum. Bookmark the permalink.

### 10 Responses to 0, 1, superposition

1. I was noting this with some friends earlier while we were doing CS homework. This particular mistake is many years old though. I.e., years ago the media was always saying “quantum computers are powerful because they work in trinary.” Now the media is saying “quantum computers are powerful because they solve everything in parallel, so they can solve NP-complete problems in polynomial time.”
Yeah… :-|.

2. Aaron Denney says:

And qutrits will have four states, zero, one, two, and a superposition…

3. quantum says:

The article goes on to say that an n-dit has 2^n-1 states: all the basis states, then pairwise superpositions, then superpositions of triples, etc. A quantum computer can compute on all these states in superposition. Therefore n qubits — enough to represent a (2^n)-dit — suffice for checking 2^(2^n) solutions in constant time! And this is without even using all the different mixed states…

4. I’m always concerned that people will mistake my explanations of what a qubit is, assuming that quantum computers are classical analogue computers. I’ve never worried about people thinking that it was a three level system. Maybe it’s time to start worrying about that!

5. serafino says:

If it were so, the Aymara ‘trinary’ language
http://www.aymara.org/biblio/igr/igr3.html
would be a sort of quantum language. Or not?

6. Blake Stacey says: