4 ms·
from what I read that's still an exponential problem for Quantum computers Shor's algorithm is cubic, not exponential, in the log (i.e. the number of bits) of
by dfranke 15y ago
from what I read that's still an exponential problem for Quantum computers
Shor's algorithm is cubic, not exponential, in the log (i.e. the number of bits) of the number being factored.
- Retric 15y agoThe difficulty is not in time, but in accuracy of measurement. In other words the signal strength directly depends on the size of number factored.