Past Events

In this metamathematical talk I shall argue that we genuinely belong under one roof: that no matter how we self-identify, in an important sense we all do the same thing. Recent developments have made the question "what is it that we do?" even more...

An association scheme X on a finite set V is a highly-regular partition of the edge set of the complete graph on V. The Terwilliger algebra $T_v$ of X with respect to a vertex $v\in V$ is an algebra defined using the neighbours of v in each graph in...

The recent striking developments in artificial intelligence underscore the idea that we need to (a) understand better what goes on inside neural networks, (b) thereby gain more control over them and (c) develop methods that are less expensive and...

A network of interacting qubits, usually subatomic particles, can be modelled by a connected weighted undirected graph G. A quantum walk on G is a deterministic process that describes the propagation of quantum states in the network represented by G...

Speakers Julia Eaton University of Washington, Tacoma Organizer Aleksandr Aravkin University of Washington Organizer, Speaker Shan Liu University of Washington Speaker Gian-Gabriel Garcia University of Washington Speaker Milagros Loreto University of...

Particles on the scale of nanometres to micrometres may be used as building blocks for new materials, with a variety of applications e.g. in optics, drug delivery, energy harvesting, and nanorobotics. A goal for theory and simulation is to build...

We determine the optimal sample complexity of low-rank quantum state tomography when each measurement may act jointly on at most $t$ samples. For sufficiently small $\epsilon$, estimating an unknown state on $C^d$ of rank at most $r$ to trace norm...

A biweekly forum on how AI is changing mathematical research, teaching, and the profession, and on what mathematics contributes to AI. Organized by PIMS and the UBC Department of Mathematics, it is informal and experience-based: short presentations...

Abstract: Time and space are the most important measures of cost in computation, even more so for quantum computation, where coherence times and logical qubit counts are critically constrained resources. Despite this, our tools for establishing...

Abstract: We study the minimum number of distinct eigenvalues q(G) of threshold graphs. It is known that every threshold graph satisfies q(G) at most 4, which suggests that a complete combinatorial characterization according to the values q(G) = 2, 3...