Simulating the Quantum World on a Classical Computer

Subscribers:
348,000
Published on ● Video Link: https://www.youtube.com/watch?v=86x0_-JGlGQ



Duration: 1:12:08
7,616 views
126


A Google TechTalk, 10/6/16, presented by Garnet Chan
ABSTRACT: Quantum mechanics is the fundamental theory underlying all of chemistry, materials science, and the biological world, yet solving the equations appears to be an exponentially hard problem. Is there hope to simulate the quantum world using classical computers? I will discuss why simulating quantum mechanics is not usually as hard as it first appears, and give some examples of how modern day quantum mechanical calculations are changing our understanding of practical chemistry and materials science.

Speaker Bio:
Garnet Chan recently joined the Cal Tech faculty as the Bren Professor in Chemistry. Before that he was the A. Barton Hepburn Professor of Chemistry at Princeton University, where he was also a member of the physics faculty. Professor Chan received his PhD from the University of Cambridge in 2000. He was born in London and grew up in Hong Kong. Professor Chan's research lies at the interface of theoretical chemistry, condensed matter physics, and quantum information theory, and is concerned with quantum many-particle phenomena and the numerical methods to simulate them. Over the last decade, his group has contributed to and invented a variety of methods addressing different aspects of quantum simulations, ranging from the challenges of strong electron correlation, to treating many-particle problems in the condensed phase, to dynamical simulations of spectra and coupling between electron and nuclear degrees of freedom. Some of these methods include density matrix renormalization and tensor network algorithms for real materials, canonical transformation-based down-foldings, local quantum chemistry methods, quantum embeddings including dynamical mean-field theory and density matrix embedding theory, and new quantum Monte Carlo algorithms. The primary focus is on methodologies for problems which appear naively exponentially hard, but where an understanding of inherent physics, for example in terms of the entanglement structure, allows for calculations of polynomial cost.




Other Videos By Google TechTalks


2016-12-06GTAC 2016: What's in your Wallet?
2016-12-06GTAC 2016: ML Algorithm for Setting Up Mobile Test Environment
2016-12-06GTAC 2016: Selenium-based Test Automation for Windows and Windows Phone
2016-12-06GTAC 2016: Automating Telepresence Robot Driving
2016-12-06GTAC 2016 - Day 1 Keynote
2016-12-06GTAC 2016: Day 1 Opening Remarks
2016-11-21AQC 2016 - Controlled Interactions Between Superconducting Qubits for Adiabatic Quantum Simulations
2016-11-21AQC 2016 - Testing Adiabatic Quantum Computers Using Simple Quantum Simulation
2016-11-21AQC 2016 - A Quantum-Assisted Algorithm for Sampling Applications in Machine Learning
2016-11-10What is in Common Between Quantum Computer and Solar System?
2016-11-10Simulating the Quantum World on a Classical Computer
2016-10-20AQC 2016 - Coupled Quantum Fluctuations and Quantum Annealing
2016-10-20AQC 2016 - Max-k-SAT, Multi-Body Frustration, & Multi-Body Sampling on a Two Local Ising System
2016-10-20AQC 2016 - Boosting Quantum Annealer Performance via Quantum Persistence
2016-10-20AQC 2016 - Avoiding Negative Sign Problem in Simulation of Quantum Annealilng
2016-10-20AQC2016 - Classical Modeling of Quantum Tunneling
2016-10-20AQC 2016 - Adiabatic Quantum Computer vs. Diffusion Monte Carlo
2016-10-20AQC 2016 - Floquet Quantum Annealing with Superconducting Circuit
2016-10-20AQC 2016 - Simulated Annealing Comparison Between All-to-All Connectivity Schemes
2016-10-20AQC 2016 - Parity Adiabatic Quantum Computing
2016-10-20AQC 2016 - Towards Quantum Supremacy with Pre-Fault-Tolerant Devices



Tags:
google techtalks
quantum computing