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. 

  

 

Tuesday Aug 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: 

 

Friday Aug 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: 

 

Friday Aug 12, 2016

In a fair comparison of the performance of a quantum algorithm to a classical one it is important to treat them on equal footing, both regarding resource usage and parallelism. We show how one may otherwise mistakenly attribute speedup due to parallelism as quantum speedup. As an illustration we will go through a few quantum machine learning algorithms, e.g. Quantum Page Rank, and show how a classical parallel computer can solve these problems faster with the same amount of resources.

Collection/Series: 
Scientific Areas: 

 

Thursday Aug 11, 2016
Speaker(s): 

The introduction of neural networks with deep architecture has led to a revolution, giving rise to a new wave of technologies empowering our modern society. Although data science has been the main focus, the idea of generic algorithms which automatically extract features and representations from raw data is quite general and applicable in multiple scenarios. Motivated by the effectiveness of deep learning algorithms in revealing complex patterns and structures underlying data, we are interested in exploiting such tool in the context of many-body physics.

Collection/Series: 
Scientific Areas: 

Pages