3 ms·
Aren't algorithms like Shor's essentially faster than others in their respected categories due to parallelization? I.e. isn't quantum superposition just a form
by axilmar 12y ago
Aren't algorithms like Shor's essentially faster than others in their respected categories due to parallelization?
I.e. isn't quantum superposition just a form of parallelization? if the quantum step in Shor's algorithm is replaced with a classical step executed in parallel in many cpus, then the speed up would be of the same order of magnitude as when using a quantum step.
- keeperofdakeys 12y agoNot really, if that was the case, quantum computers really would be faster than classical computers. A qubit is basically a normal bit, with probability a that it's in the 0 state, and b that it's in the 1 state, with a^2 + b^2 = 1. If you do some clever maths, you can get these probabilities to cancel out, and give you something that will collapse to the proper state when read. http://en.wikipedia.org/wiki/Shor's_algorithm#Finding_the_period http://en.wikipedia.org/wiki/Shor's_algorithm#Finding_the_pe... Shor's algorithm is still very theoretical though, we need to actually build a quantum computer to run it first.