Search Talks

The cobordism hypothesis gives a functorial bijection between oriented 

n-dimensional fully local topological field theories, valued in some 

higher category C, and the fully dualizable object of C equipped with 

the structure of SO(n)-fixed point.  In this talk I'll explain recent 

works of Haugseng, Johnson-Freyd and Scheimbauer which construct a 

Morita 4-category of braided tensor categories, and I'll report on joint 

work with Brochier and Snyder which identifies two natural subcategories 

therein which are 3- and 4-dualizable.  These are the rigid braided 

tensor categories with enough compact projectives, and the braided 

fusion categories, respectively.  I'll also explain work in progress by 

us to construct SO(3)- and SO(4)-fixed point structures in each case, 

starting from ribbon and pre-modular categories, respectively.

Applying the cobordism hypothesis, we obtain 3- and 4-dimensional fully 

local TFT's, which extend the 2-dimensional TFT's we constructed with 

Ben-Zvi and Brochier, and which conjecturally relate to a number of 

constructions in the literature, including: skein modules, quantum 

A-polynomials, Crane-Kauffmann-Yetter invariants; hence our construction 

puts these on firm foundational grounds as fully local TFT's.  A key 

feature of our construction in dimension 3 is that we require the input 

braided tensor category neither to be finite, nor semi-simple, so this 

opens up new examples -- such as non-modularized quantum groups at roots 

of unity -- which were not obtainable by earlier methods.

Port-based teleportation (PBT) is a variant of the well-known task of quantum teleportation in which Alice and Bob share multiple entangled states called "ports". While in the standard teleportation protocol using a single entangled state the receiver Bob has to apply a non-trivial correction unitary, in PBT he merely has to pick up the right quantum system at a port specified by the classical message he received from Alice. PBT has applications in instantaneous non-local computation and can be used to attack position-based quantum cryptography. Since perfect PBT protocols are impossible, there is a trade-off between error and entanglement consumption (or the number of ports), which can be analyzed using representation theory of the symmetric and unitary groups. In particular, without loss of generality the resource state can be assumed to have a “purified" Schur-Weyl duality symmetry. I will give an introduction to the task of PBT and its symmetries, and show how the asymptotics of existing formulas for the optimal performance for a given number of ports can be derived using a connection between representation theory and the Gaussian unitary ensemble.

Joint work with M. Christandl, C. Majenz, G. Smith, F. Speelman & M. Walter

In the first part of the talk, I will describe the new large N limit of tensor models, based on the “index” of graphs (in contrast to the standard large N expansion  based on the “degree”), and the associated new large D limit of matrix models. This new limit sheds an interesting light on the relation between disordered models à la SYK, tensor models and black holes. In the second part of the talk, I will apply these ideas to discuss the phase diagrams of some strongly coupled matrix quantum mechanics. The phase diagrams display many interesting features, including first and second order phase transitions and quantum critical points. Some of these phase transitions can be argued to provide a quantum mechanical description of the phenomenon of gravitational collapse. 

Detections of compact binary coalescences with Advanced LIGO and Advanced Virgo are now starting to become routine. However, thereis still considerably more information that can be gleaned from these observations, particularly as detector sensitivity and waveform modelsboth improve. We start by describing the methods currently used in LIGO/Virgo data analysis to determine the mass and spin of the remnant black hole of the binary black hole coalescences. These black holes have the most well-measured masses and spins of any stellar-mass black holes observed and comparable or better mass accuracies to Sgr A*. We also describe the method used to obtain a lower bound on the radiated energy of the binary neutron star coalescence GW170817, and discuss further information one can extract from these observations by postprocessing parameter estimation results. We also describe a method for placing constraints on properties of black hole mimickers, such as boson stars or gravastars, if binaries of these objects are to produce the signals identified as coming from binary black holes. We present initial results of the method applied to injections in simulated noise, and as a proof of principle show how it is possible to rule out or constrain the properties of a specific model of boson stars using a given detection.

Can computers think? They can certainly calculate - with staggering speed and ever-increasing power - and they have driven scientific and technological advances that would have been impossible without them. Even so, we would like to believe that, for some puzzles, there's no substitute for old-fashioned human intuition. But this view may be changing.

A new breed of machine learning algorithms have begun knocking down cognitive milestones that, until recently, scientists believed were still decades away. Major advances are being made in computer vision, language translation, autonomous robotic action, and other complex applications. At the same time, these new algorithms are helping scientists accelerate discovery in physics.

This stunning progress poses as many questions as answers: What are the fundamental possibilities and limits of machine learning? Can we create true human-level artificial intelligence, and how might its thoughts differ from our own? What new breeds of computer will fuel artificial intelligence and, conversely, how will artificial intelligence enable new forms of computing?

In his public lecture at Perimeter Institute, Roger Melko will explore how computers have helped humanity solve increasingly complex puzzles, and ask which challenges, if any, only human intuition is equipped to tackle.

Several equivalent formulations of quantum error correction condition will be introduced. Subtleties arise

when the error correction conditions hold only approximately. We will discuss an equivalent formulation that is 

robust to the approximation error. One can leverage this tool to derive the existence of approximate quantum

error correcting code at low energy subspace of CFT that reproduces aspects of the holographic quantum error

correcting code. Using the same tool, we observe that two operators with greatly differing complexity approximately

commute in an appropriate code subspace. This leads to a notion of bulk locality in the entanglement shadow,

but the precise definition of complexity seems to play an important role in determining how well these operators commute

in the subspace.