Only marginally, and it's going to take a loooooooong time until you'll have a quantum computer the size of today's classical computers to actually see any improvement from Grover's algorithm.
Shor's is a completely different matter entirely: the difference between exponential and linear time is so huge that even a comparatively tiny QC (only a few million qubits) would significantly outpace the largest classical supercomputers put together on this specific problem.
Shor's is a completely different matter entirely: the difference between exponential and linear time is so huge that even a comparatively tiny QC (only a few million qubits) would significantly outpace the largest classical supercomputers put together on this specific problem.