NP-hard problems are not in BQP.

Reiner Czerwinski

Published in: CoRR (2023)

Keyphrases

np hard problems
np hard
knapsack problem
constraint programming
combinatorial search
graph coloring
constraint propagation
optimal solution
dynamic programming