A super-polynomial quantum advantage for combinatorial optimization problems.
Niklas PirnayVincent UlitzschFrederik WildeJens EisertJean-Pierre SeifertPublished in: CoRR (2022)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- knapsack problem
- optimization problems
- metaheuristic
- ant colony optimization
- discrete optimization
- job shop scheduling
- traveling salesman problem
- job shop scheduling problem
- shortest path problem
- continuous optimization problems
- min cost
- exact algorithms
- vehicle routing problem
- quantum computation
- minmax regret
- evolutionary algorithm
- search space
- quantum mechanics
- tabu search
- learning algorithm