Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Theory of Near-Term Quantum Advantage - Part 4

IAS | PCMI Park City Mathematics Institute via YouTube

Overview

Explore quantum computation theory and near-term quantum advantage in this comprehensive lecture from the University of Chicago's Bill Fefferman at the Park City Mathematics Institute. Delve into the critical goal of demonstrating quantum computations that surpass classical computer capabilities, examining both theoretical foundations and practical implications. Learn about experimental quantum advantage as a milestone toward fault-tolerant quantum computers and its role in testing quantum theory in high complexity scenarios. Examine current evidence supporting near-term quantum experiments' potential to solve classically intractable problems, while understanding classical simulation algorithms' limitations. Cover key concepts including the Porter Thomas property, heavy output generation, linear crossentropy, and simulation results. Part of the 2023 PCMI Graduate Summer School program focusing on quantum computation, this lecture integrates with a broader curriculum featuring expert-led minicourses on quantum learning, information theory, linear-algebraic algorithms, error-correcting codes, and the complexity theory of random circuits and Hamiltonians.

Syllabus

Introduction
Why this might make sense
The Porter Thomas property
Heavy output generation
Why is this attractive to us
How does the reduction work
Linear crossentropy
Why is xcb hard
Open questions
Simulation results

Taught by

IAS | PCMI Park City Mathematics Institute

Reviews

Start your review of Theory of Near-Term Quantum Advantage - Part 4

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.