Indeed. A quantum computer can’t brute force NP-hard problems in polynomial time simply by being a quantum computer. It is indeed faster than a classical computer, but it’s still not fast enough. A quantum computer can brute force a problem in the square root of the time it takes a classical computer to do so, but the square root of an exponential function is still exponential. If the classical computer brute forces a problem of size n in 2^n time, then the quantum computer takes (sqrt(2))^n time.
Indeed. A quantum computer can’t brute force NP-hard problems in polynomial time simply by being a quantum computer. It is indeed faster than a classical computer, but it’s still not fast enough. A quantum computer can brute force a problem in the square root of the time it takes a classical computer to do so, but the square root of an exponential function is still exponential. If the classical computer brute forces a problem of size n in 2^n time, then the quantum computer takes (sqrt(2))^n time.