Since 2002 Perimeter Institute has been recording seminars, conference talks, and public outreach events 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 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.
Graduate Course on Standard Model & Quantum Field Theory
It will be shown that eternal inflation of the random walk type is generically absent in the brane inflationary scenario. Eternal inflation will be analysed both in the context of KKLMMT and the DBI inflationary models. A Langevin analysis will be employed for a more careful treatment. The DBI action, and the relativistic nature of the brane motion in DBI inflationary model, leads to new subtleties in formulating a Langevin approach.
I will discuss some ambiguities involved in using the AdS/CFT correspondence
to calculate the ultra-relativistic jet quenching parameter for quarks moving in
an N=4 super Yang-Mills thermal bath. Along the way, I will investigate the behavior of various string configurations on a five-dimensional AdS black hole
background.
Quantum Information and Entanglement Assisted Quantum Communication
In this talk, I will show how to efficiently generate graph states
based on realistic linear optics (with imperfect photon detectors and source), how to do scalable quantum computation with probabilistic atom photon
interactions, and how to simulate strongly correlated many-body physics with ultracold atomic gas.
Graduate Course on Standard Model & Quantum Field Theory
Graduate Course on Standard Model & Quantum Field Theory
TBA
Classical Information and Quantum Information
Complexity class MA is a class of yes/no problems for which the answer `yes\' has a short certificate that can be efficiently checked by a classical randomized algorithm. We prove that MA has a natural complete