Speaker: Cui Jingjing, Professor and Doctoral Supervisor, Southwest Jiaotong University

Date: January 9, 2026

Time: 14:30 pm

Location: B711, Mingde Building, Shandong University; Tencent Meeting: 103 631 880

Sponsor: School of Mathematics, Shandong University

Abstract:

Combinatorial optimisation problems lie at the core of mathematics, computer science, and engineering, yet many of them remain computationally intractable at realistic scales. Recent advances in quantum computing offer a promising—though still evolving—pathway to address such challenges. This report provides a mathematically grounded overview of how quantum algorithms interact with classical optimisation theory. We first review key models of combinatorial optimisation and their complexity characteristics. We then introduce fundamental quantum computing concepts and discuss representative quantum and hybrid quantum–classical approaches, including variational algorithms and the Quantum Approximate Optimization Algorithm (QAOA). Particular emphasis is placed on the mathematical structure underlying these methods, their approximation behavior, and the regimes in which quantum resources may provide an advantage. Through illustrative examples and comparative analysis, we highlight both the potential and current limitations of quantum approaches. The report concludes by outlining open problems and research directions at the interface of optimisation theory and quantum computation.

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/209670.htm