Graphical Reasoning in Symmetric Monoidal Categories
- đ¤ Speaker: Lucas Dixon - University of Edinburgh
- đ Date & Time: Wednesday 27 January 2010, 14:15 - 15:15
- đ Venue: Lecture Theatre 1, Computer Laboratory
Abstract
Symmetric monoidal categories capture the basic structure of a variety of important domains, including quantum computations. An important feature is that they have a natural visual presentation that is similar to traditional circuit diagrams. Additional structure specific to a domain, such as quantum information, is sometimes captured as equations between 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 will describe how such notation in graphs can be made amenable to computer-aided 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.
Finally, I will show how this can be used to perform a graphical version of symbolic proof and computation.
Series This talk is part of the Wednesday Seminars - Department of Computer Science and Technology series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Chris Davis' list
- computer science
- Department of Computer Science and Technology talks and seminars
- Graduate-Seminars
- Guy Emerson's list
- Interested Talks
- Lecture Theatre 1, Computer Laboratory
- Martin's interesting talks
- School of Technology
- se393's list
- Trust & Technology Initiative - interesting events
- Wednesday Seminars - Department of Computer Science and Technology
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Lucas Dixon - University of Edinburgh
Wednesday 27 January 2010, 14:15-15:15