A Quantum Global Optimization Algorithm: Application to the Knapsack Problem

Quantum Optimisation Achieves Near-Optimal Solutions For 10-Facility Quadratic Assignment Problems

A new quantum algorithm, utilising non-variational quantum walks, demonstrates promising performance in solving small instances of the Quadratic Assignment Problem, consistently achieving optimal or near-optimal solutions with fewer steps than some classical methods and outperforming a leading quantum search algorithm.

A Quantum Global Optimization Algorithm: Application to the Knapsack Problem

Solving combinatorial optimization problems represents a challenge for researchers, especially hard NP-complete problems that are commonly handled through heuristic methods providing approximate solutions. The emergence of quantum computing, which enables performing parallel computation, raise...