Graphical Reasoning in Symmetric Monoidal Categories

Duration: 46 mins 51 secs
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: http://www.talks.cam.ac.uk/talk/index/22081
 
Created: 2010-06-09 10:42
Collection: Computer Laboratory Wednesday Seminars
Publisher: University of Cambridge
Copyright: Computer Laboratory
Language: eng (English)
 
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.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 480x360    1.84 Mbits/sec 647.99 MB View Download
WebM 480x360    627.95 kbits/sec 215.55 MB View Download
Flash Video 480x360    805.69 kbits/sec 277.06 MB View Download
Flash Video 320x240    436.9 kbits/sec 150.24 MB View Download
iPod Video 480x360    505.28 kbits/sec 173.75 MB View Download
MP3 44100 Hz 125.03 kbits/sec 42.78 MB Listen Download
Auto * (Allows browser to choose a format it supports)