I can't say that I'm very well familiar with quantum computing or the science behind it, but as far as I know, quantum computing is only applicable to a rather narrow spectrum of tasks. Well, it seems that breaking encrypting algos falls right into its scope of problem solving,
solving binary problems such as SHA, d-wave is not that great at.
quantum is better at non binary things.
for instance. instead of just binary(2 option): on off, yes no, stay go, true false
quantum can do DNA..
0 A
1 C
2 G
4 T
and can map DNA better and recalculate it easily.
mapping
0 north
1 east
2 south
3 west
where as in binary it needs 2bits to do a single option like that
00 north
10 east
01 south
11 west
basically quantum 'bits' are only 2x efficient than binary bits when it comes to binary problems.
but quantum can be more efficient at other things non binary.
I'm not sure what to make of that. As I see it, you are just suggesting to use calculations based not on just 2 digits (binary calculations) but on a higher base (4, 8, ...). Honestly, I don't see any difference here, as whatever base you use, you can always simplify it to the binary notation without losing anything. Are you certain that your understanding of quantum computing is correct? Personally, I always thought it has more to do with using some physical phenomena (actually, quantum phenomena) to make calculations and get relevant results. In other words, you do not calculate in the usual way like 2+2 but use some quantum effects which kind of do calculations for you, and then you just write down the result.
Briefly, it is very different from using your fingers to calculate a sum, which is what "normal" computing comes down to (no matter what base you use).