Computational phase transition in Quantum Approximate Optimization Algorithm - the difference between hard and easy.
Bingzhi ZhangQuntao ZhuangPublished in: CoRR (2021)
Keyphrases
- optimization algorithm
- phase transition
- random instances
- hard problems
- multi objective
- random constraint satisfaction problems
- constraint satisfaction
- satisfiability problem
- random sat
- randomly generated
- differential evolution
- optimization method
- graph coloring
- evolutionary multi objective
- particle swarm optimization pso
- np complete
- sat problem
- random graphs
- optimization strategy
- np complete problems
- constraint satisfaction problems
- evolutionary algorithm
- artificial bee colony
- global optima
- lower bound
- cellular automata
- hybrid optimization algorithm
- traveling salesman problem