Not really: NP-hard problems are a set of a decision problems "does a route shorter than x exist?" while in quantum computing, we know an answer exists but the question is obtaining it. E.g. the factors of a number always exist.