thesis defense - computer science: huixiang zhang

please join the department of computer science for the upcoming thesis defense:

presenter: huixiang zhang

thesis title: a hybrid quantum-classical architecture for combinatorial decision optimization in networked systems

abstract: combinatorial decision optimization problems arise widely in modern networked systems, where limited communication, computing, and service resources must be efficiently allocated under complex operational constraints. representative examples include supply-demand matching in data markets, topology control in self-organizing unmanned aerial vehicle (uav) swarms, and microservice scheduling across the cloud-edge continuum. these problems are typically np-hard, and as system scale increases or operating conditions evolve rapidly, traditional mixed-integer linear programming (milp) formulations often become difficult to solve within real-time decision windows. as a unified binary optimization framework, quadratic unconstrained binary optimization (qubo) provides a common way to map diverse combinatorial problems to quantum annealing and quantum-inspired solvers with the potential for significant computational speed advantages. however, the practical use of qubo in real networked systems still faces three major barriers. first, qubo modeling remains manual, expert-dependent, and error-prone. second, standard qubo formulations are inherently static and therefore not well suited to time-varying environments. third, the binary representation of qubo does not naturally align with the continuous resource allocation requirements of real systems. to address these limitations, this thesis develops a hybrid quantum-classical optimization methodology for networked systems. it first formulates and validates domain-specific qubo models for representative applications. then it generalizes these efforts through two-stage hybrid frameworks that combine offline combinatorial optimization with lightweight online decision-making for dynamic uav topology control and robust microservice scheduling. finally, it investigates large language model driven automation of the milp-to-qubo pipeline and integrates benders decomposition to improve scalability for larger problem instances. overall, this thesis shows that qubo can serve not only as a problem-specific solution form, but also as a transferable modeling layer that connects heterogeneous network optimization tasks with near-term quantum hardware, thereby providing a practical pathway toward quantum-enhanced decision-making.


committee members:
dr. mahzabeen emu (supervisor, committee chair), dr. thiago e alves de oliveira (co-supervisor), dr. xing tan, dr. elif ak (memorial university)

please contact grad.compsci@lakeheadu.ca for the zoom link. everyone is welcome.