BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Graphical Reasoning in Symmetric Monoidal Categories - Lucas Dixon
  - University of Edinburgh
DTSTART:20100127T141500Z
DTEND:20100127T151500Z
UID:TALK22081@talks.cam.ac.uk
CONTACT:Mateja Jamnik
DESCRIPTION:Symmetric monoidal categories capture the basic structure of a
  variety of important domains\, including quantum computations. An importa
 nt feature is that they have a natural visual presentation that is similar
  to traditional circuit diagrams. Additional structure specific to a domai
 n\, such as quantum information\, is sometimes captured as equations betwe
 en diagrams. Informally\, such equations may involve 'ellipses'-notation (
 as in the "1 ... n" notation used for a list of numbers from 1 to n). I wi
 ll describe how such notation in graphs can be made amenable to computer-a
 ided manipulation\, why this is important\, and the interesting structural
  properties that result. I will illustrate the graphical language applied 
 to quantum computations and boolean circuits. \n\nFinally\, I will show ho
 w this can be used to perform a graphical version of symbolic proof and co
 mputation.\n\n
LOCATION:Lecture Theatre 1\, Computer Laboratory
END:VEVENT
END:VCALENDAR