EURO 2025 Leeds
Abstract Submission

1728. Comparative Analysis of four Quantum Optimization workflows for Telecommunication Networks

Invited abstract in session WC-16: Quantum Computing for Optimization, stream Quantum OR .

Wednesday, 12:30-14:00
Room: Esther Simpson 2.07

Authors (first author is the speaker)

1. Ali Abbassi
LIST3N, Orange Innovation Châtillon, University of Technology of Troyes
2. Yann Dujardin
Orange innovation Châtillon
3. Eric Gourdin
Orange
4. Philippe LACOMME
ISIMA, LIMOS
5. Caroline Prodhon
University of Technology of Troyes

Abstract

Quantum computing is emerging as a promising approach for solving combinatorial optimization problems. This study considers a use case of interest for the the telecomunication industry. We compare the performance of four quantum computing platforms—D-Wave, Pasqal, IBM, and Quandela—on solving the minimum edge multicut problem. Each platform follows a different computational paradigm: D-Wave employs Quantum Annealing, Pasqal and IBM could be used with the Quantum Approximate Optimization Algorithm (QAOA) and Quantum Adiabatic Algorithm (QAA), while Quandela applies a variational quantum circuit method.
We modeled our telecom problem according to (respectively) every QC computational paradigm and conduct numerical experiments to analyse solution quality, computational efficiency, and workflow complexity of the different techonologies and associated instance scaling challenges.
Each quantum system presents distinct bottlenecks: D-Wave requires careful QUBO formulation and embedding, Pasqal is limited by atom distance constraints, IBM faces decoherence and gate noise in QAOA, and Quandela must optimize variational circuit depth and parameters. By assessing these challenges, we provide insights into the strengths and limitations of current quantum optimization techniques using real and simulated QPU, highlighting their potential impact on real-world applications.

Keywords

Status: accepted

Back to the list of papers