3 papers
quant-ph2026
A quantum feasibility preserving modeling for the min cut problem
Ali Abbassi, Yann Dujardin, Eric Gourdin +2
We study the minimum cut problem in weighted undirected graphs using variational quantum algorithms in which only feasible cut configurations are explored. Although minimum cut adm…
quant-ph2026
Quantum Approaches to the Minimum Edge Multiway Cut Problem
Ali Abbassi, Yann Dujardin, Eric Gourdin +2
We investigate the minimum edge multiway cut problem, a fundamental task in evaluating the resilience of telecommunication networks. This study benchmarks the problem across three…
quant-ph2026
Assessing Quantum Annealing to Solve the Minimum Vertex Multicut
Ali Abbassi, Yann Dujardin, Eric Gourdin +2
Cybersecurity in telecommunication networks often leads to hard combinatorial optimization problems that are challenging to solve with classical methods. This work investigates the…