Basically anything related to the theory of quantum mechanics is fair game, but we are especially interested in mathematically rigorous things related to quantum computation, quantum information and quantum error correction, and adjacent matters in condensed matter theory. Some specific buzzwords and phrases that we expect to get kicked around a lot (based on our local idiosyncrasies) include: TQFT, topological order, spin systems, state preparation, categorical symmetry, fault tolerance, complexity, etc...
Date & Format | Speaker | Title (click for abstract) |
Labor Day is 9/1 |
NO TALK | |
Monday 15 September 1-2pm EDT IN-PERSON |
Isaac Kim (UC Davis) |
Entanglement bootstrap programI will present an overview of a research program dubbed "entanglement bootstrap," which aims to be a mathematical theory for defining topological phases on a lattice and classifying them. If time permits, I will describe a recent progress in making the framework invariant under constant-depth quantum circuits, as well as several classification results for topological phases in two spatial dimensions. |
Monday 22 September 1-2pm IN-PERSON |
Jin-Cheng Guu (UAlberta) |
Lurie's Topological Field Theory and Skein TheoryJacob Lurie's classification of fully extended topological field theories applies in a broad and abstract setting across all dimensions. However, concrete examples remain scarce. In three dimensions, the Turaev-Viro theory has long been conjectured to fit within this framework. In this talk, we will establish that it necessarily does, outline a sketch of the proof, and explore the essential role of skein theory in this context. |
Monday 29 September 1-2pm IN-PERSON |
Tyler Ellison (Purdue) |
Universal quantum computation with group surface codesThe surface code is one of the leading approaches to building a fault-tolerant quantum computer, actively pursued by groups at Google, IBM, Microsoft, and elsewhere. A central challenge for the surface code is implementing non-Clifford -- unitary operations that map Pauli operators to non-Pauli operators. In this talk, I will introduce group surface codes, which are a natural generalization of the usual \(\mathbb{Z}_2\) surface code and can be understood as quantum double models with specific boundary conditions. I will argue that group surface codes, for suitably chosen groups, can be leveraged to perform non-Clifford gates in the \(\mathbb{Z}_2\) surface code. Time permitting I will describe three strategies for completing a universal gate set using group surface codes: (1) through magic state preparation, (2) using transversal non-Clifford gates, and (3) by sliding group surface codes. These strategies extend recent efforts in performing universal quantum computation in topological orders without the braiding of anyons. This talk is based on upcoming work with Vieri Mattei, Naren Manjunath, and Apoorv Tiwari. |
Monday 6 October 1-2pm IN-PERSON |
Guilherme Delfino (Purdue) |
SETs from gauging modulated symmetriesIn this talk, I will discuss the gauging of Abelian modulated symmetries -- finite counterparts of subsystem symmetries -- that act non-uniformly across space. In two dimensions, this provides a simple route to constructing symmetry-enriched topological phases (SETs), where crystalline symmetries enrich the charges carried by topological anyons. Using local Hamiltonians of spin chains as a concrete setting, I will show how the dual theories feature exact modulated 1-form symmetries accompanied by mixed anomalies. |
Fall Break is 10/13-10/14 |
NO TALK | |
Monday 20 October 1-2pm IN-PERSON |
Jiaqi Leng (Berkeley) |
Hamiltonians as a Unifying Language for Quantum Machine LearningAs Moore's Law slows, quantum computers promise to accelerate computationally intensive machine learning tasks like training and data generation. However, a fundamental disconnect exists between the continuous, analog nature of modern ML models (defined by real-valued parameters and data) and the discrete, digital logic of the dominant quantum circuit model. This mismatch creates an unnatural and often unintuitive foundation for designing new quantum algorithms and frameworks. In this talk, I argue that the Hamiltonian formalism, a computational model equivalent to quantum circuits, provides a natural and powerful alternative. I will demonstrate how Hamiltonians serve as a unifying language for designing new quantum algorithms for key ML tasks, such as optimization and sampling, leading to provable speedups. Crucially, because Hamiltonians directly describe the low-level physics of quantum hardware, this approach also enables vastly more efficient algorithm compilation. This hardware-aware framework bypasses many overheads of the circuit model, paving the way for deploying large-scale quantum ML applications on near-term devices. |
Monday 3 November 1-2pm IN-PERSON |
Greta Panova (USC) |
TBATBA |
Monday 10 November 1-2pm IN-PERSON |
Fiona Burnell (Minnesota) |
TBATBA |
Friday 21 November 1-2pm IN-PERSON DSAI 1004 |
Leo Lo (Harvard) |
TBATBA |
Monday 1 December 1-2pm IN-PERSON |
Yanzhu Chen (Florida State) |
TBATBA |
Monday 8 December 1-2pm IN-PERSON |
Andrew Sornborger (Los Alamos) |
TBATBA |
Date & Format | Speaker | Title (click for abstract) |
MLK Day is 1/19 |
NO TALK | |
Monday 23 February 1-2pm IN-PERSON |
Gerardo Ortiz (IU) | TBATBA |
Spring Break is 3/16-3/29 |
NO TALK |