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.
Density functional theory (DFT) is an extremely popular approach to electronic structure problems in both materials science and chemistry and many other fields. Over the past several years, often in collaboration with Klaus Mueller at TU Berlin, we have explored using machine-learning to find the density functionals that must be approximated in DFT calculations. I will summarize our results so far, and report on two new works.
Quantum mechanics is down to earth - quite literally - since the electrons within the tiny crystals found in a handful of dirt manifest a dizzying world of quantum motion. Each crystal has it’s own unique choreography, with the electrons entangled in a myriad of quantum dances. Quantum entanglement
An increase in the efficiency of sampling from Boltzmann distributions would have a significant impact in deep learning and other machine learning applications. Recently, quantum annealers have been proposed as a potential candidate to speed up this task, but several limitations still bar these state-of-the-art technologies from being used effectively.
Machine learning is a rapidly growing field in computer science with applications in computer vision, voice recognition, medical diagnosis, spam filtering, search engines, etc. In this presentation, I will introduce a new machine learning approach based on quantum Boltzmann distribution of a transverse-field Ising Model. Due to the non-commutative nature of quantum mechanics, the training process of the Quantum Boltzmann Machine (QBM) can become nontrivial. I will show how to circumvent this problem by introducing bounds on the quantum probabilities.
Can quantum computers outperform classical computers on any computational problem in the near future? We study the problem of sampling from the output distribution of random quantum circuits.
Sampling from this distribution requires an exponential amount of classical computational resources. We argue that quantum supremacy can be achieved in the near future with approximately fifty superconducting qubits and without error correction despite the fact that quantum random circuits are extremely sensitive to errors.