NP-hard problem
QuantumNP-hard problem: A problem at least as difficult as every problem in NP. Whether quantum computers can efficiently solve NP-complete problems remains open; Grover’s quadratic speed-up applies to unstructured search.
NP-hard problem: A problem at least as difficult as every problem in NP. Whether quantum computers can efficiently solve NP-complete problems remains open; Grover’s quadratic speed-up applies to unstructured search.