BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Wednesday Seminars - Department of Computer Scienc
e and Technology
SUMMARY:Graphical Reasoning in Symmetric Monoidal Categori
es - Lucas Dixon - University of Edinburgh
DTSTART;TZID=Europe/London:20100127T141500
DTEND;TZID=Europe/London:20100127T151500
UID:TALK22081AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/22081
DESCRIPTION:Symmetric monoidal categories capture the basic st
ructure of a variety of important domains\, includ
ing quantum computations. An important feature is
that they have a natural visual presentation that
is similar to traditional circuit diagrams. Additi
onal structure specific to a domain\, such as quan
tum information\, is sometimes captured as equatio
ns between diagrams. Informally\, such equations m
ay involve 'ellipses'-notation (as in the "1 ... n
" notation used for a list of numbers from 1 to n)
. I will describe how such notation in graphs can
be made amenable to computer-aided manipulation\,
why this is important\, and the interesting struct
ural properties that result. I will illustrate the
graphical language applied to quantum computation
s and boolean circuits. \n\nFinally\, I will show
how this can be used to perform a graphical versio
n of symbolic proof and computation.\n\n
LOCATION:Lecture Theatre 1\, Computer Laboratory
CONTACT:Mateja Jamnik
END:VEVENT
END:VCALENDAR