Le contenu de cette page n’est pas disponible en français. Veuillez nous en excuser.

Video Library

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. 

  

 

Jeudi aoû 18, 2016
Speaker(s): 

Aretakis' discovery of a horizon instability of extremal black holes came as something of a surprise given earlier proofs that individual frequency modes are bounded. Is this kind of instability invisible to frequency-domain analysis? The answer is no: We show that the horizon instability can be recovered in a mode analysis as a branch point at the horizon frequency. We use the approach to generalize to nonaxisymmetric gravitational perturbations and reveal that certain Weyl scalars are unbounded in time on the horizon.

Collection/Series: 
Scientific Areas: 

 

Mardi aoû 16, 2016
Speaker(s): 

Quantum many-body systems are challenging to study because of their exponentially large Hilbert spaces, but at the same time they are an area for exciting new physics due to the effects of interactions between particles. For theoretical purposes, it is convenient to know if such systems can be expressed in a simpler way in terms of some nearly-free quasiparticles, or more generally if one can construct a large set of operators that approximately commute with the system’s Hamiltonian.

Collection/Series: 
Scientific Areas: 

 

Vendredi aoû 12, 2016
Speaker(s): 

This talk presents a quantum algorithm for performing persistent homology, the identification of topological features of data sets such as connected components, holes and voids. Finding the full persistent homology of a data set over n points using classical algorithms takes time O(2^{2n}), while the quantum algorithm takes time O(n^2), an exponential improvement. The quantum algorithm does not require a quantum random access memory and is suitable for implementation on small quantum computers with a few hundred qubits.

Collection/Series: 
Scientific Areas: 

Pages