Is it possible to speed up the factorization of a number by simulating quantum computing?

Question

Parallel Computing

Everyone knows that factorization of a number is a task with great computational complexity.
The best algorithms factorize a semiprime number in subexponential time, but not polynomial time. Factorization with polynomial complexity is possible on a quantum computer using Shor 's algorithm .
In principle, the simulation of the simplest quantum operators (gates) is also possible on a classical computer. It all comes down to operations on matrices. Operations on which can be parallelized on N computers.
Now the actual question:
If we apply computational parallelism for operations on matrices in a network of computers, is it possible that we can spend less time (in O-notation) than if we used standard factorization algorithms?
Please give a constructive answer.

Answer 1

Theoretically, bruteforce can also be parallelized so that each machine checks only one option, but then we need a number equal to the number of operations, then bruteforce will be instant, but where can we get so many machines?)
That is, you need to take a piece of paper and a pencil ( or clav and some python), and calculate the optimal ratio of execution time to the amount of resources. If you get options that can be implemented in the real world - then yes, if not - alas.
Still, I'm inclined to the "no" option, otherwise many smart people would have broken RSA, DH, and others like them long ago, since it is known that a quantum computer is the death of asymmetric cryptography (is it complete?). And the simulation is just a simulation, and it works slower than the original intended. After all, if we add a Toyota body to the Zhiguli, then they won’t drive like a Toyota Zhiguli) ... and if you redo everything inside like a Toyota, then it will no longer be a Zhiguli, but a Toyota)
As for the last phrase, I can be wrong, because I don’t know the subtleties implementation of simulators and QC (quantum computer).

Answer 2

Quantum algorithms are efficient because they run on quantum computers. On normal, no increase in speed can be achieved. Otherwise they would be classic.