Adiabatic quantum optimization fails for random instances of NP-complete problems
Boris AltshulerHari KroviJérémie RolandPublished in: CoRR (2009)
Keyphrases
- np complete problems
- random instances
- np complete
- phase transition
- graph coloring
- hard problems
- constraint satisfaction problems
- constraint satisfaction
- randomly generated
- optimization algorithm
- combinatorial problems
- np hard
- decision problems
- utility function
- constraint programming
- satisfiability problem
- search problems
- optimization problems