David Bindel, Cornell, USA, SIAG-LA Lecturer

Christoph Helmberg, Technische Universität Chemnitz, Germany

Leslie Hogben, Iowa State University, USA

Apoorva Khare – LAMA Lecturer, Indian Institute of Science, Bangalore, India

Igor Klep,  University of Auckland, New Zealand

Gitta Kutyniok, Technische Universität Berlin, Germany

Joseph Landsberg, Texas A&M, USA, LAA Lecturer supported by Elsevier

Federico Poloni, Pisa University, Italy

Nikhil Srivastava, University of California, Berkeley, USA

Yuan Jin Yun, Universidade Federal do Paraná, Brazil

Invited Mini-Symposia

Matrix Analysis
James Pascoe & Miklos Palfia

Frames
Gitta Kutyniok & Deanna Needell

Matrix Equations and Matrix Inequalities
Fuzhen Zhang & Qing-Wen Wang

Algebra and Tensor Spaces
David Gleich & Yang Qi

Linear Algebra and Quantum Information Science
Yiu-Tung PoonRaymond Nung-Sing Sze & Sarah Plosker

Combinatorial Matrix Theory
Bryan ShaderShaun FallatSteve Butler & Kevin Vander Meulen

Matrix Techniques in Operator Theory and Operator Algebras
Hugo Woerdeman

Spectral Graph Theory
Sebastian Cioaba, Jack Koolen & Leonardo de Lima

Linear Algebra Education
Sipedeh Stewart & Rachel Quinlan

Nonnegative Inverse Spectral Problems
Raphael Loewy & Ricardo L. Soto

 

Contributed Mini-Symposia

To appear

MC 1: Graph Theory and Quantum Walks

Gabriel Coutinho, Universidade Federal de Minas Gerais, UFMG, Brazil
Krystal Guo, Simons Institute for the Theory of Computing
Abstract: The study of quantum walks is a relatively new field with relations to Graph Isomorphism, quantum search algorithms and implementation of gate-based quantum algorithms. It is an area which has seen many successful applications of methods in linear algebra and graph theory, especially eigenvalue techniques in graphs. In this mini-course, we will cover basic definitions and properties of discrete and continuous time quantum walks on graphs. In the first lecture, we will talk about state transfer in graphs. In the second lecture, we will talk about the average mixing matrix which would be the analogue of a stationary distribution of a random walk. In the third, we will present the well-known Grover search algorithm as a quantum walk on a graph. In the last lecture, we will discuss many graph invariants given by quantum walks, some of which have inspired possible Graph Isomorphism algorithms. We will not assume any prior knowledge of quantum physics.


MC 2: Title and abstract to be announced

Carlos Tomei, Pontifícia Universidade Católica, PUC-Rio, Brazil

To appear