Theory of Near-Term Quantum Advantage - Part 2
IAS | PCMI Park City Mathematics Institute via YouTube
Most AI Pilots Fail to Scale. MIT Sloan Teaches You Why — and How to Fix It
Build the Finance Skills That Lead to Promotions — Not Just Certificates
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore quantum computation fundamentals in this lecture from the University of Chicago's Bill Fefferman, focusing on the theory of near-term quantum advantage and its implications for experimental quantum computing. Delve into the critical goal of demonstrating quantum computations that surpass classical computer capabilities, examining both theoretical foundations and practical applications. Learn about current evidence supporting near-term quantum experiments' potential to solve classically intractable problems, while gaining insights into classical simulation algorithms for these experiments. Access comprehensive lecture notes and problem sets to reinforce understanding of quantum computing concepts, linear algebra applications, and quantum theory in high complexity scenarios. Part of the 2023 PCMI Graduate Summer School program, this lecture connects to a broader curriculum covering quantum learning, information theory, error-correcting codes, and Hamiltonian complexity.
Syllabus
Part 2 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)
Taught by
IAS | PCMI Park City Mathematics Institute