Department of Mathematical Sciences
Chris Godsill, University of Waterloo
Wednesday, March 4th, 2026
4:00PM-4:50PM
Stratton Hall 311
Speaker: Chris Godsill, University of Waterloo
Title: Controllable Graphs
Abstract: A graph on n vertices is controllable if its adjacency matrix A and the n × n all- ones matrix J together generate the full matrix algebra of real n × n matrices. I will discuss some of the properties and consequences of this concept, and of some related properties. For example the automorphism group of a controllable graph is trivial and almost all graphs are controllable. I will also discuss how controllable graphs can be used to produce complete sets of gates for quantum computation.