Quantum Approaches to the Minimum Edge Multiway Cut Problem
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909980011003904 |
|---|---|
| author | Abbassi, Ali Dujardin, Yann Gourdin, Eric Lacomme, Philippe Prodhon, Caroline |
| author_facet | Abbassi, Ali Dujardin, Yann Gourdin, Eric Lacomme, Philippe Prodhon, Caroline |
| contents | 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 quantum computing paradigms: quantum annealing on a D-Wave quantum processing unit, photonic variational quantum circuits simulated on Quandela s Perceval platform, and IBM s gate-based Quantum Approximate Optimization Algorithm (QAOA). We assess the comparative feasibility of these approaches for early-stage quantum optimization, highlighting trade-offs in circuit constraints, encoding overhead, and scalability. Our findings suggest that quantum annealing currently offers the most scalable performance for this class of problems, while photonic and gate-based approaches remain limited by hardware and simulation depth. These results provide actionable insights for designing quantum workflows targeting combinatorial optimization in telecom security and resilience analysis. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_00720 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Quantum Approaches to the Minimum Edge Multiway Cut Problem Abbassi, Ali Dujardin, Yann Gourdin, Eric Lacomme, Philippe Prodhon, Caroline Quantum Physics Discrete Mathematics 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 quantum computing paradigms: quantum annealing on a D-Wave quantum processing unit, photonic variational quantum circuits simulated on Quandela s Perceval platform, and IBM s gate-based Quantum Approximate Optimization Algorithm (QAOA). We assess the comparative feasibility of these approaches for early-stage quantum optimization, highlighting trade-offs in circuit constraints, encoding overhead, and scalability. Our findings suggest that quantum annealing currently offers the most scalable performance for this class of problems, while photonic and gate-based approaches remain limited by hardware and simulation depth. These results provide actionable insights for designing quantum workflows targeting combinatorial optimization in telecom security and resilience analysis. |
| title | Quantum Approaches to the Minimum Edge Multiway Cut Problem |
| topic | Quantum Physics Discrete Mathematics |
| url | https://arxiv.org/abs/2601.00720 |