What I mean is that I would consider quantum computing a failure if it took us "from n2 to n1.5". That would make it the same as SIMD or parallel computing. I s

What I mean is that I would consider quantum computing a failure if it took us "from n2 to n1.5". That would make it the same as SIMD or parallel computing. I still think that linear-time factoring or sorting could be revolutionary, but only if enough interesting problems can be reduced to them. I'm holding out hope for a fast quantum SAT3 solver, at that point it will just be a waiting game until you can get an expansion card for solving NP-hard problems.