2 papers
quant-ph2026
Variational quantum algorithms for permutation-based combinatorial problems: Optimal ansatz generation with applications to quadratic assignment problems and beyond
Dylan Laplace Mermoud, Andrea Simonetto, Sourour Elloumi
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction o…
cs.DS2024
A rounding and clustering-based exact algorithm for the p-center problem
Zacharie Ales, Cristian Duran-Matelunaa, Sourour Elloumi
The p-center problem consists in selecting p facilities from a set of possible sites and allocating a set of clients to them in such a way that the maximum distance between a clien…