Title: How do we use graphs to transmit quantum information? Time: 3.30pm, Atlantic time, (1:30, CDT) Wednesday Sept. 18 Speaker: Hermie Monterde, University of Manitoba Abstract: In this talk, a graph $G$ represents a quantum spin network (a networking of interacting subatomic particles). The vertices and edges of $G$ represent the particles and their interactions in the network. Consider the complex unitary matrix $U(t)=\exp(itA)$, where $A$ is the adjacency matrix of $G$, $i^2=-1$ and $t$ is a real number. The propagation of quantum…

The Martin Invariant and Other Results on the Interlace Polynomials Josephine Reynes, University of Waterloo There are many well studied graph polynomials, but this talk will focus on the Martin polynomial and the interlace polynomial. Specifically, this talk will look at how these two polynomials are related and how results on the Martin polynomial can be extended to the interlace polynomial. The Martin invariant, a specific evaluation of the Martin polynomial, obeys the symmetries of the Feynman period. The Feynman…

Speaker #1: Peter Collier, Dalhousie University Title #1: Zero Forcing on Twisted Hypercubes Abstract #1: The hypercube stands out as a compelling and versatile structure that extends the geometric notion of a cube into higher dimensions. We study the twisted hypercube variant in an attempt to optimize processes on similarly degree-regular, highly connected graphs. The particular process we optimize is zero forcing, a graph infection process in which a particular colour change rule is iteratively applied to the graph and an…