Canadian Summer School on Quantum Information (CSSQI) (10th : 2010)

Graph theory in quantum information Godsil, Chris


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.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International