What is NP-hard problem?

NP-hard problem

Quantum

NP-hard problem: A problem at least as difficult as the hardest in NP, for which quantum computers offer at best quadratic improvement, not an exponential one.

Related terms

Backlog problem
Collision problem
Data loading problem
Element distinctness problem
Hidden shift problem
Hidden subgroup problem (HSP)
Local Hamiltonian problem
Output readout problem

Browse the full glossary →