Since 2002 Perimeter Institute has been recording seminars, conference talks, public outreach events such as talks from top scientists using video cameras installed in our lecture theatres. Perimeter now has 7 formal presentation spaces for its many scientific conferences, seminars, workshops and educational outreach activities, all with advanced audio-visual technical capabilities.
Recordings of events in these areas are all available and On-Demand from this Video Library and on Perimeter Institute Recorded Seminar Archive (PIRSA). PIRSA is a permanent, free, searchable, and citable archive of recorded seminars from relevant bodies in physics. This resource has been partially modelled after Cornell University's arXiv.org.
Accessibly by anyone with internet, Perimeter aims to share the power and wonder of science with this free library.
In this talk I will review the interpretation of Wilson line operators in the context of higher spin gravity in 2+1 dim and holography. I will show how a Wilson line encapsulates the thermodynamics of black holes. Furthermore it provides an elegant description of massive particles. This opens a new window of observables which will allow us to probe the true geometrical nature of higher spin gravity.
We observe a finite subvolume of the universe, so CMB and large scale structure data may give us either a representative or a biased sample of statistics in the larger universe. Mode coupling (non-Gaussianity) in the primordial perturbations can introduce a bias of parameters measured in any subvolume due to coupling to superhorizon background modes longer than the size of the subvolume. This leads to a "cosmic variance" of statistics on smaller scales, as the long-wavelength background modes vary around the global mean.
Problems in computer science are often classified based on the scaling of the runtimes for algorithms that can solve the problem. Easy problems are efficiently solvable but often in physics we encounter problems that take too long to be solved on a classical computer. Here we look at one such problem in the context of quantum error correction. We will further show that no efficient algorithm for this problem is likely to exist. We will address the computational hardness of a decoding problem, pertaining to quantum stabilizer codes considering independent X and Z errors on each qubit.