8 citations · 12 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
A Hybrid Quantum-Classical Approach to the Electric Mobility Problem
Margarita Veshchezerova, Mikhail Somov, David Bertsche +4
We suggest a hybrid quantum-classical routine for the NP-hard Electric Vehicle Fleet Charging and Allocation Problem. The original formulation is a Mixed Integer Linear Program wit…
Addition and Differentiation of ZX-diagrams
Emmanuel Jeandel, Simon Perdrix, Margarita Veshchezerova
The ZX-calculus is a powerful framework for reasoning in quantum computing. It provides in particular a compact representation of matrices of interests. A peculiar property of the…
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…