Go to  Advanced Search

Graph theory in quantum information

Show full item record

Files in this item

Files Size Format Description   View
Graph Theory 1.mp4 218.6Mb video/mp4 Video View in browser View/Open
Graph Theory 2.mp4 202.1Mb video/mp4 Video View in browser View/Open
Graph Theory 3.mp4 219.4Mb video/mp4 Video View in browser View/Open
Graph Theory 4.mp4 163.5Mb video/mp4 Video View in browser View/Open
graph_theory1.pdf 557.6Kb Adobe Portable Document Format Slides   View/Open
graph_theory2.pdf 640.0Kb Adobe Portable Document Format Slides   View/Open
graph_theory3.pdf 782.5Kb Adobe Portable Document Format Slides   View/Open
graph_theory4.pdf 846.0Kb Adobe Portable Document Format Slides   View/Open
 
Title: Graph theory in quantum information
Other Titles: Graph theory
Author: Godsil, Chris
Subject Keywords graph theory, quantum information
Issue Date: 2010-07-19
Publicly Available in cIRcle 2010-12-01
Abstract: There are a number of significant problems in quantum information where there is an interesting connection with graph theory. Gleason's theorem proves an interesting result about graph coloring. There are grounds to hope that graph isomorphism can be dealt with more efficiently on a quantum computer. Discrete quantum walks are defined on graphs. Graph states underly measurement-based quantum computing and play an important role in quantum codes. Even questions about mub's and sic-povm's, which appear to be entirely geometrical, are related to classical problems in graph theory. I aim to discuss these problems, and to provide an introduction to the related graph theory.
Affiliation: Non UBC
URI: http://hdl.handle.net/2429/30256
Peer Review Status: Unreviewed
Scholarly Level: Faculty

This item appears in the following Collection(s)

Show full item record

All items in cIRcle are protected by copyright, with all rights reserved.

UBC Library
1961 East Mall
Vancouver, B.C.
Canada V6T 1Z1
Tel: 604-822-6375
Fax: 604-822-3893