3 ms·
Quantum computers do not make NP-hard problems significantly easier to solve than on classical computers. They're better at prime factorization, but in a way t
by mapmeld 10y ago
Quantum computers do not make NP-hard problems significantly easier to solve than on classical computers.
They're better at prime factorization, but in a way that's well understood (quantum Fourier transform) and possible to simulate on classical computers.