BEGIN:VCALENDAR
CALSCALE:GREGORIAN
METHOD:PUBLISH
PRODID:-//github.com/rianjs/ical.net//NONSGML ical.net 4.0//EN
VERSION:2.0
X-FROM-URL:https://eom.sdu.dk/events/ical/0826ca50-93b6-4b07-b843-c744434a
 a508
X-WR-CALNAME:QC Research Seminar: Planning and Satisfiability for Optimal 
 Quantum Circuits
BEGIN:VTIMEZONE
TZID:Europe/Copenhagen
X-LIC-LOCATION:Europe/Copenhagen
BEGIN:DAYLIGHT
DTSTAMP:20260602T163405Z
DTSTART:20261028T030000
SEQUENCE:0
TZNAME:CEST
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
UID:d5971779-d3b0-4bfa-9d0a-eca10d4017d1
END:DAYLIGHT
BEGIN:STANDARD
DTSTAMP:20260602T163405Z
DTSTART:20260325T020000
SEQUENCE:0
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
UID:c823ab99-7316-4b05-9162-4b093d5a3bb0
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DESCRIPTION:QC Seminar: Jaco van de Pol\, Professor of Computer Science\, 
 Aarhus University (DK) & University of Twente (NL)\n\nQuantum computers n
 eed quantum software to carry out interesting tasks\, and quantum program
 mers need design tools to construct correct and efficient quantum softwar
 e. One such tools is an optimizing compiler.In this talk\, we focus on th
 e optimization of quantum circuits. We will discuss the task to resynthes
 ize quantum circuits built from certain gate sets and the layout synthesi
 s needed to map quantum circuits to specific quantum hardware platforms. 
 We will discuss various optimization criteria (e.g. size and depth\, in o
 rder to reduce noise and required quantum resources) and various correctn
 ess requirements\, like equivalence up-to a permutation of the output qub
 its. We will demonstrate how “classical design tools” like SAT solvers an
 d automated planning can help optimizing quantum circuits.
DTEND:20251023T140000Z
DTSTAMP:20260602T163405Z
DTSTART:20251023T130000Z
LOCATION:Syddansk Universitet\, Campusvej 55\, 5230\, Odense M
SEQUENCE:0
SUMMARY:QC Research Seminar: Planning and Satisfiability for Optimal Quant
 um Circuits
UID:421e1690-1e77-4e68-ba1d-4e68264cb196
END:VEVENT
END:VCALENDAR