|
|
|
|
|
by erikaww
1088 days ago
|
|
I'm not educated on QC. But wouldn't Grover's algorithm be very useful? I believe it provides a sqrt(n) time search. For QC to be useful,it just needs to make common utilities very fast. I should look more into QC. It would be cool if it could speed all computation up. I understand there are algorithms that it could execute that a classical composer could not, but I wonder if it could eventually he like just faster hardware. |
|
What that means is that they are a constant times the cost of simply reading the input. Often, the computation is actually cheaper.
Quantum computing might make some computations have a smaller theoretical constant, but it is almost certain that the practical constant ($/bit of input) will be much, much worse due to scale.
Right now, only very specialized computations look like they will ever have any speedup. And even that is only maybe, in practice.