BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260408T090222Z
UID:Seminar-dept-1296@lxserverA.csc.liv.ac.uk.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20260303T130000
DTEND:20260303T140000
SUMMARY:School Seminar Series
DESCRIPTION:Ieva Čepaitė: Quantum heuristics for hard optimisation problems\n\nA potential near-term application of quantum computers is that of solving hard combinatorial optimisation problems. In this talk, I will introduce the basics of quantum computing, the combinatorial problem structures which are amenable to being solved by quantum methods, as well as delving into some of the algorithms and approaches that have been explored for solving them. If I have time, I will hopefully talk about some of our recent work on quantum-enhanced methods for optimisation. More concretely, I will cover the quadratic unconstrained binary optimisation (QUBO) problem model, which describes many NP-hard problem instances (in particular graph-based problems), quantum adiabatic dynamics and quantum annealing, as well as the quantum approximate optimisation algorithm (QAOA). I will aim to make the talk as accessible as possible to those who have never encountered quantum computing or much combinatorial optimisation in the past. \n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1296
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR