BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Ondřej Lengál (Brno University of Technology)
DTSTART:20260520T130000Z
DTEND:20260520T140000Z
DTSTAMP:20260602T195609Z
UID:FLAT/21
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/FLAT/21/">Au
 tomata-based verification of quantum circuits</a>\nby Ondřej Lengál (Brn
 o University of Technology) as part of One FLAT World Seminar\n\n\nAbstrac
 t\nDevelopment of quantum programs is hard due to their intricate structur
 e and inherently probabilistic nature. Computer-aided tool support is ther
 efore essential. Computer-based reasoning over quantum programs is\, howev
 er\, also challenging due to the exponential size of the program's state. 
 In this talk\, I will present a recent framework for automated formal veri
 fication of quantum programs that uses automata to represent complex sets 
 of quantum states compactly.\n
LOCATION:https://researchseminars.org/talk/FLAT/21/
END:VEVENT
END:VCALENDAR