BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.c3voc.de//qtcat-2026//talk//X8NKSX
BEGIN:VTIMEZONE
TZID:CET
BEGIN:STANDARD
DTSTART:20001029T040000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000326T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-qtcat-2026-X8NKSX@pretalx.c3voc.de
DTSTART;TZID=CET:20260812T113000
DTEND;TZID=CET:20260812T120000
DESCRIPTION:String diagrams are often traced back to Richard Penrose's work
  in mathematical physics\, but they also have an early and largely overloo
 ked history in computer science through Günter Hotz. Following in the foo
 tsteps of Hotz\, this talk will provide an introduction to string diagrams
  through the lens of circuit design.  Rather than beginning with category 
 theory\, we start from circuits and their computational properties\, and t
 hen work backwards to the categorical structures they describe. For exampl
 e\, we will see how modelling feedback motivates compact closed categories
  and reversibility suggests the structure of a monoidal dagger category. W
 e will then see how the ability to copy data gives rise to Cartesian categ
 ories\, with the no-cloning theorem identifying precisely why quantum circ
 uits lack this structure. When circuits are no longer Cartesian\, basic op
 erations such as conditional statements become harder to reason about grap
 hically. We conclude with a look at ongoing work on controlled monoidal ca
 tegories and controlled string diagrams\, which aim to restore graphical r
 easoning for conditional statements in non-Cartesian circuits.
DTSTAMP:20260812T210543Z
LOCATION:R. 221
SUMMARY:The Road from Circuits to Category Theory - Scott Wesley
URL:https://pretalx.c3voc.de/qtcat-2026/talk/X8NKSX/
END:VEVENT
END:VCALENDAR