BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv7.32.0//EN
X-ORIGINAL-URL:https://dcn.nat.fau.eu/
X-WR-CALNAME:
X-WR-CALDESC:FAU DCN-AvH. Chair for Dynamics, Control, Machine Learning and Numerics -Alexander von Humboldt Professorship
X-WR-TIMEZONE:Europe/Berlin
BEGIN:VTIMEZONE
TZID:Europe/Berlin
X-LIC-LOCATION:Europe/Berlin
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20260329T030000
RRULE:FREQ=YEARLY;BYMONTH=03;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20261025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=4SU
END:STANDARD
END:VTIMEZONE
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-3152e3b1e52e2cb123363787d5f76c95@dcn.nat.fau.eu
DTSTART;TZID=Europe/Berlin:20201216T160000
DTEND;TZID=Europe/Berlin:20201216T170000
DTSTAMP:20211020T084755Z
CREATED:20211020
LAST-MODIFIED:20220117
PRIORITY:5
SEQUENCE:0
TRANSP:OPAQUE
SUMMARY:Variational neural annealing
DESCRIPTION:Speaker: Dr. Estelle Inack\nAffiliation: Perimeter Institute for Theoretical Physics, Canada\nZoom Link\nMeeting ID: 946 4114 8960 | PINcode: 427926\nAbstract. Many combinatorial optimization problems relevant to computer science, computational biology and physics can be tackled with simulated annealing, which is a powerful framework for optimizing the properties of complex systems through the lens of statistical mechanics. However, simulated annealing and its quantum counterpart, simulated quantum annealing, are traditionally implemented via Markov chain Monte Carlo, often displaying slow convergence to optimal solutions for challenging optimization problems. Here we combine the variational principle in classical and quantum physics with recurrent neural networks, whose dynamics are naturally devoid of slow Markov chains to accurately emulate annealing in its classical and quantum formulations. We find that a variational implementation of classical annealing is not only superior to its quantum analog in terms of speed of convergence and accuracy of solutions but also outperforms traditional simulated annealing and simulated quantum annealing on several prototypical spin glass models as the annealing time is increased. In addition, through the use of the sign-problem-free variational Monte Carlo method, our framework can emulate quantum annealing with non-stoquastic drivers at moderately large system sizes, thus providing a useful tool to benchmark the next generation of quantum annealing devices which implement non-stoquastic Hamiltonians.\n
URL:https://dcn.nat.fau.eu/events/variational-neural-annealing/
CATEGORIES:FAU CAA Seminar
ATTACH;FMTTYPE=image/png:https://dcn.nat.fau.eu/wp-content/uploads/FAUcaa-seminars-16dec2020.png
END:VEVENT
END:VCALENDAR