RSS icon
Twitter icon
Facebook icon
Vimeo icon
YouTube icon

Optimization and physics: the hardness of a problem and annealing strategies to solve it

July 27, 2018 - 3:30pm
Speaker: 
Tobias Grass
Institution: 
JQI
Abstract: Many combinatorial optimization problems pose a challenge to classical computers. Annealing algorithms which can solve such problems have been established by exploring the relation to statistical physics. In recent years, annealing strategies which involve quantum fluctuations have become feasible and might provide some quantum speed-up. In this lecture, I will discuss these different approaches to optimization problems.
 

Important Note: Food and beverages provided after the talk (around 4:45pm)

PSC 2136