Showing quant-phShow all
2 papers · 1 filter
quant-ph2025
Qubit-efficient quantum local search for combinatorial optimization
M. Podobrii, V. Kuzmin, V. Voloshinov +2
An essential component of many sophisticated metaheuristics for solving combinatorial optimization problems is some variation of a local search routine that iteratively searches fo…
quant-ph2020
Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles
Constantin Dalyac, Loïc Henriet, Emmanuel Jeandel +4
In order to qualify quantum algorithms for industrial NP-Hard problems, comparing them to available polynomial approximate classical algorithms and not only to exact ones -- expone…