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.

翻译：本研究针对最小边多路割问题展开探讨，该问题是评估电信网络鲁棒性的基础性任务。我们在三种量子计算范式中对该问题进行基准测试：基于D-Wave量子处理单元的量子退火、在Quandela的Perceval平台上模拟的光子变分量子电路，以及IBM基于量子门的量子近似优化算法（QAOA）。我们评估了这些方法在早期量子优化应用中的相对可行性，重点分析了电路约束、编码开销与可扩展性之间的权衡。研究结果表明，对于此类问题，量子退火目前展现出最优的可扩展性能，而光子和基于门的方法仍受限于硬件条件与模拟深度。这些发现为面向电信安全与鲁棒性分析中组合优化问题的量子工作流设计提供了具有实践指导意义的见解。