BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Stewart Blusson Quantum Matter Institute - ECPv6.18.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Stewart Blusson Quantum Matter Institute
X-ORIGINAL-URL:https://qmi.miffanytark.com
X-WR-CALDESC:Events for Stewart Blusson Quantum Matter Institute
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Vancouver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Vancouver:20250123T100000
DTEND;TZID=America/Vancouver:20250123T110000
DTSTAMP:20250115T234034Z
CREATED:20250115T234034Z
LAST-MODIFIED:20250115T234034Z
UID:8499-1737626400-1737630000@qmi.miffanytark.com
SUMMARY:CM Seminar: Just-in-time compiling Shor's algorithm with PennyLane and Catalyst\, Olivia Di Matteo\, UBC
DESCRIPTION:Speaker: Olivia Di Matteo\, UBC \nTime: 10:00-11:00am \nLocation: BRIM 311 \n\nAbstract: As quantum computing hardware continues to improve\, so must the tools we use to write quantum algorithms. There is a growing need for more expressive quantum programming languages that enable developers to write code at higher levels of abstraction than quantum circuits. This\, in turn\, necessitates robust and automated compilers that can generate optimized sequences of quantum operations in a scalable way. Such compilers are especially important for algorithms with many interdependent classical and quantum subroutines\, such as Shor’s factoring algorithm. \nIn this talk I will provide a pedagogical introduction to Shor’s algorithm by presenting its implementation at varying levels of abstraction. While its high-level subroutines are straightforward to express\, compilation and optimization incurs a large overhead due to the algorithm’s randomized nature. To that end\, I will highlight on-going work on a fully just-in-time-compiled implementation using PennyLane and Catalyst. I’ll discuss its scaling\, practical resource requirements\, implementation tricks (and unique quirks)\, and the feasibility of executing it on near-term hardware.
URL:https://qmi.miffanytark.com/event/just-in-time-compiling-shors-algorithm-with-pennylane-and-catalyst/
CATEGORIES:CM Seminar
END:VEVENT
END:VCALENDAR