Skip to main content Skip to side menu Skip to main menu

Computer Science

Events

CS Seminar by Prof. Youngmin Kwon (Friday, November 8, 2 PM)

Writer Computer Science Date Created 2024.11.12 Hits413

Prof. Youngmin Kwon will be giving a talk on "Quantum Approximate Optimization Algorithm for Quadratic Unconstrained Binary Optimization problems".

Title: Quantum Approximate Optimization Algorithm for Quadratic Unconstrained Binary Optimization problems
Date & Time: Friday, November 8, 2 PM
Venue: B204

Abstract
Quantum Approximate Optimization Algorithm (QAOA) is an optimization technique inspired by the Quantum Adiabatic Theorem. Because of its robustness against noises, it is one of the most suitable quantum techniques for this Noisy Intermediate-Scale Quantum (NISQ) era. Although the actual speed-up is debatable, the algorithm showed a performance better than classical optimization algorithms. Quadratic Unconstrained Binary Optimization (QUBO) is a combinatorial optimization problem that has a wide range of applications. In this talk, I will demonstrate how some computational problems can be expressed in QUBO problems and explain how QUBO problems can be solved by QAOA.