The UTC Graduate School is pleased to announce that Gloria Oppong will present Master’s research titled, Combinatorial Optimization using Quantum Computing on 02\/26\/2026 at 11:00 AM to 12:00 PM in Lupton Hall, Room 393. Everyone is invited to attend.
Mathematics
Chair: Lakmali Weerasena
Co-Chair:
Abstract:
This thesis explores quantum computing for combinatorial optimization through the Traveling Salesman Problem (TSP), which aims to find a minimum-cost Hamiltonian cycle visiting each city exactly once. Using Qiskit, we implement the Quantum Approximate Optimization Algorithm (QAOA) on both simulators and quantum hardware, and compare its performance with that of classical exact optimization via the Gurobi solver. TSP instances are encoded as Quadratic Unconstrained Binary Optimization (QUBO) problems derived from the Miller\u2013Tucker\u2013Zemlin formulation, with degree and subtour constraints embedded using quadratic penalties. Results indicate that QAOA consistently generates feasible tours, but classical branch-and-bound solvers outperform it in both solution quality and runtime. On Noisy Intermediate-Scale Quantum (NISQ) devices, the optimality gap grows with problem size, reflecting sensitivity to variational parameter tuning, penalty scaling, and hardware noise. Among classical optimizers for QAOA, COBYLA offers the most effective tradeoff between efficiency and noise tolerance. Overall, this work establishes a reproducible quantum-classical workflow, provides performance baselines, and identifies critical factors such as encoding design, optimizer choice, and error mitigation for improving near-term quantum heuristic performance.<\/p>\n","protected":false},"excerpt":{"rendered":"
The UTC Graduate School is pleased to announce that Gloria Oppong will present Master’s research titled, Combinatorial Optimization using Quantum Computing on 02\/26\/2026 at 11:00 AM to 12:00 PM in Lupton Hall, Room 393. Everyone is invited to attend. Mathematics Chair: Lakmali Weerasena Co-Chair: Abstract: This thesis explores quantum computing for combinatorial optimization through the Traveling Salesman Problem (TSP), which aims… <\/p>\n