Search Talks

In her Perimeter Institute public lecture, premiering May 12, mathematician Emily Riehl will invite viewers to consider what might be called the “matchmaker’s dilemma.”   

Imagine a matchmaker who wishes to arrange opposite-sex marriages in a dating pool of single men and single women (there’s a mathematical reason for the heteronormative framework, which will be explained). 

The matchmaker’s goal is to pair every man and woman off into couples that will form happy, stable marriages – so perfectly matched that nobody would rather run off with someone from a different pairing. 

In the real world, things don’t work out so nicely. But could they work out like that if the matchmaker had a computer algorithm to calculate every single factor of compatibility? 

In her talk, recorded as part of the Perimeter Institute Public Lecture Series, Riehl will examine that question, its sexist implications, an algorithmic solution, and real-world applications. 

An associate professor of mathematics at Johns Hopkins University, Riehl has published more than 20 papers and two books on higher category theory and homotopy theory. She studied at Harvard and Cambridge and earned her PhD at the University of Chicago.  

In addition to her research, Riehl is active in promoting access to the world of mathematics. She is a co-founder of Spectra: the Association for LGBT Mathematicians, and has presented on mathematical proof and queer epistemology as part of several conferences and lecture series. 

In recent years, random quantum circuits have played a central role in the theory of quantum computation. Much of this prominence is due to recent random quantum circuit sampling experiments which have constituted the first claims of "quantum supremacy".   While random quantum circuits enjoy certain advantages that make them ideal for implementation by near-term quantum experiments, it is unclear a priori why they should be difficult to simulate classically. While we know several examples of quantum algorithms which attain exponential speedups over classical computation, they all seem to rely on highly structured circuits (such as quantum Fourier transforms) which are far from typical. Why then should we expect a generic quantum circuit to realize a large computational advantage?

In this talk we will explain the complexity theoretic basis for the classical hardness of random circuit sampling.

This talk will be based on joint work with Adam Bouland, Chinmay Nirkhe, and Umesh Vazirani (https://arxiv.org/abs/1803.04402), as well as Adam Bouland, Yunchao Liu and Zeph Landau (https://arxiv.org/abs/2102.01738).

Zoom Link: https://pitp.zoom.us/j/92408058752?pwd=b1JoeTVISlpjaXk3ZjBoSi9pYjNUZz09

The power of quantum information lies in its capacity to be non-local, encoded in correlations among entangled particles.  Yet our ability to produce, understand, and exploit such correlations is hampered by the fact that the interactions between particles are ordinarily local.  I will report on experiments in which we use light to engineer non-local interactions among cold atoms, with photons acting as messengers conveying information between them.  We program the spin-spin couplings in an array of atomic ensembles by tailoring the frequency spectrum of an optical control field.  We harness this programmability to access interaction graphs conducive to frustration and to explore quantum spin dynamics in exotic geometries and topologies.  More broadly, advances in optical control of interactions open new opportunities in areas ranging from quantum technologies to fundamental physics.  I will touch on implications for quantum-enhanced sensing, combinatorial optimization, and simulating quantum gravity.

Crossing symmetry asserts that particles are indistinguishable from anti-particles traveling back in time. In quantum field theory, this statement translates to the long-standing conjecture that probabilities for observing the two scenarios in a scattering experiment are described by one and the same function. Why could we expect it to be true? In this talk we examine this question in a simplified setup and take steps towards illuminating a possible physical interpretation of crossing symmetry. To be more concrete, we consider planar scattering amplitudes involving any number of particles with arbitrary spins and masses to all loop orders in perturbation theory. We show that by deformations of the external momenta, one can smoothly interpolate between the future and the past lightcones without encountering any singularities.

Inflation generically predicts a background of primordial gravitational waves, which generate a primordial B-mode component in the polarization of the cosmic microwave background (CMB). The measurement of such a B-mode signature would lend significant support to the paradigm of inflation. Observed B modes also contain a component from the gravitational lensing of primordial E modes, which can obscure the measurement of the primordial B modes. We reduce the sample variance in the BB spectrum contributed from this lensing component by a process called 'delensing.' In this talk, I will show results from the first demonstration in an improved constraint on primordial gravitational waves with delensing using data from BICEP/Keck, the South Pole Telescope (SPT), and Planck. In addition, I will provide an outlook of joint-analysis efforts of the BICEP/Keck and the SPT collaborations (the South Pole Observatory) to constrain primordial gravitational waves. 

Classical probabilistic models of quantum systems are not only relevant for understanding the non-classical features of quantum mechanics, but they are also useful for determining the possible advantage of using quantum resources for information processing tasks.  A common feature of these models is the presence of inaccessible information, as captured by the concept of preparation contextuality:  There are ensembles of quantum states described by the same density operator, and hence operationally indistinguishable, and yet in any probabilistic (ontological) model, they should be described by distinct probability distributions.  In this talk, I discuss a method for quantifying this inaccessible information and present a family of lower bounds on this quantity in terms of experimentally measurable quantities. These bounds, which can also be interpreted as a new class of robust non-contextuality inequalities, are obtained based on a family of guessing games.  As an application of this result, I derive a noise threshold for the presence of contextually in a noisy system, in terms of the average gate fidelity of the noise channel.

The model of Causal Dynamical Triangulations (CDT) is a background-independent and diffeomorphism-invariant approach to quantum gravity,

which provides a lattice regularization of the formal gravitational path integral. The framework does not involve any coordinate system and employs only geometric invariants. For a Universe with toroidal spatial topology, we can introduce coordinates using classical scalar fields with periodic boundary conditions with a jump. The field configurations reveal pictures of cosmic voids and filaments surprisingly similar to the ones observed in the present-day Universe. I will discuss the impact of dynamical matter fields on the geometry of a typical quantum universe in the four-dimensional CDT model and explain several observed phenomena. In particular, a phase transition is triggered by the change of the scalar field jump amplitude. This discovery may have important consequences for quantum universes with non-trivial topology since the phase transition can change the topology to a simply connected one.

Gravitational waves provide a unique observational handle on the properties of strong, dynamical gravity. Ringdowns, in particular, cleanly encode information about the structure of black holes, allowing us to test fundamental principles like the no-hair theorem and the area law. In this talk, I will review the status of this effort, including recent observational results and remaining challenges.

In his May 5 Perimeter Public Lecture webcast, Harvard professor L. Mahadevan will take viewers on a journey into the mathematical, physical, and biological workings of morphogenesis to demonstrate how scientists are beginning to unlock many of the secrets that have vexed scientists since Darwin.

We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We treat them as subsystem codes and show that the set of transversally implementable logical operations is contained in the Clifford group for sufficiently localized logical subsystems. As well as proving this concretely for several specific codes, we argue that this restriction naturally arises in any stabilizer subsystem code that comes close to capturing certain properties of holography. We extend these results to approximate encodings, locality-preserving gates, certain codes whose logical algebras have non-trivial centers, and discuss cases where restrictions can be made to other levels of the Clifford hierarchy. A few auxiliary results may also be of interest, including a general definition of entanglement wedge map for any subsystem code, and a thorough classification of different correctability properties for regions in a subsystem code.

I will present a single idea about representation which allows several recent advances in neural networks  to be combined into an imaginary system called GLOM.  GLOM answers the question: How can a neural network with a fixed architecture parse an image into a part-whole hierarchy which has a different structure for each image? The idea is simply to use islands of identical vectors to represent the nodes in the parse tree. The talk will discuss the many ramifications of this idea.  If GLOM can be made to work, it should significantly improve the interpretability of the representations produced by neural nets when applied to vision or language.