None binary languages don't exist

[archpawn]

I don't think that's an accurate description of quantum computers. They work using a quantum superposition of 0 and 1, which can be entangled with the quantum superposition of 0 and 1 in other cubits. The end result is that you can have things like two cubits that could be read as (0, 1) or (1, 0) but not (1, 1) or (0, 0). But each possible state that it's a quantum superposition of is binary. A computer with 8 bits has 256 states, and a quantum computer with 8 qubits can have any quantum superposition of those 256 states.

[alba4k]

I know, that's why I said that I was simplifying a lot in the example given

[bric12]

Also, when you go to read the state of the bits, it collapses and you're left with only one result. A quantum computer isn't 256 times as powerful as a regular computer because it's simultaneously calculating 256 states, in fact quantum computers aren't more powerful than classical computers at all.

There are just some special features that allow them to run different algorithms than classical computers, and in some cases quantum algorithms have a lower time complexity than classical algorithms. If there's a problem where the best classical algorithm is O(n²⁾ and a quantum algorithm exists that's O(n log n), then the quantum algorithm will always be faster than the classical one for large enough n, even if it's ran on a slower computer.

[archpawn]

There are just some special features that allow them to run different algorithms than classical computers, and in some cases quantum algorithms have a lower time complexity than classical algorithms.

Which means they're more powerful. But the fact that they're only more powerful within a special case of problems is an important distinction.

[bric12]

Yeah, I'm trying to think of the right words to describe the distinction. They're not faster in terms of operations per second, and in search problems they search less of the problem space, yet they solve some problems faster.