BEGIN:VCALENDAR
VERSION:2.0
PRODID:Icfo
X-PUBLISHED-TTL:P1W
BEGIN:VEVENT
UID:6aa1d2eeeaa89
DTSTART:20250430T130000Z
SEQUENCE:0
TRANSP:OPAQUE
DTEND:20250430T140000Z
LOCATION:Blue Lecture Room
SUMMARY:ICFO | TOBIAS REINHART 
CLASS:PUBLIC
DESCRIPTION:Many applications of classical spin systems rely on the idea th
 at fairly simple&nbsp\;systems suffice to simulate the low energy behavior
  of arbitrary complicated ones. For instance\, considering quantum anneali
 ng\, certain Ising systems can be programmed to simulated arbitrary other 
 systems and thereby computing&nbsp\;ground states of the Ising systems all
 ows one to solve arbitrary&nbsp\;optimization problems.\nWhat is the struc
 ture of such&nbsp\;simulations between spin systems\,&nbsp\;how does one b
 est approach the task of constructing simulations of a&nbsp\;target system
  and in particular\, under what conditions is one guaranteed that simulati
 ng the target system is even possible with the&nbsp\;spin systems availabl
 e?\nTo address such questions we develop a framework for simulations betwe
 en classical spin systems. We derive properties of simulations that imply 
 that complicated simulations can be constructed locally\, by combining sim
 pler ones. Leveraging these results\, we prove a full characterization of 
 those&nbsp\;sets of spin systems which&nbsp\;are universal\, i.e. which su
 ffice to efficiently&nbsp\;simulate arbitrary target systems.&nbsp\;Since 
 the characterization is constructive\, it provides a step-by-step guide to
  construct arbitrary simulations and hence might be used in all applicatio
 ns that are based&nbsp\;on the existence of such.&nbsp\;
DTSTAMP:20260909T214310Z
END:VEVENT
END:VCALENDAR