BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Quadratic unconstrained binary optimisation and recent advances in
  quantum annealing - Georg Hahn
DTSTART:20181108T141500Z
DTEND:20181108T151500Z
UID:TALK113161@talks.cam.ac.uk
CONTACT:Johannes Bausch
DESCRIPTION:Since the 1970s\, the potential of quantum computing has been 
 a field of extensive research\, particularly its advantages and disadvanta
 ges over classical computing. This research\, however\, was theoretical si
 nce physical quantum devices were unavailable. With the recent availabilit
 y of the first (alleged) adiabatic computers\, or quantum annealers\, comp
 utational mathematics and statistics (as all other computational sciences)
  are provided with a new means of great potential. This talk will begin wi
 th an introduction to quadratic unconstrained binary optimisation (qubo) a
 nd hardware aiming to solve such optimisation problems via quantum anneali
 ng\, and proceed with a presentation of experimental results. Special focu
 s will be given to two topics: Solving the NP-hard problem of finding maxi
 mal cliques in a graph and the reduction of binary quadratic forms for sca
 lable quantum annealing. To stimulate discussion\, the talk will highlight
  future directions of research\, for instance the characterisation of prob
 lem classes allowing formulations suitable for quantum annealing\, the man
 ipulation of qubo instances while preserving global optima\, the statistic
 al analysis of the (empirical) distribution of annealing solutions\, and t
 he exploitation of the inherent randomness in adiabatic computing for stat
 istical purposes.
LOCATION:MR4\, Centre for Mathematical Sciences\, Wilberforce Road\, Cambr
 idge
END:VEVENT
END:VCALENDAR