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 3

IAS | PCMI Park City Mathematics Institute via YouTube

Overview

Explore quantum computation theory and experimental quantum advantage in this 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 - a milestone essential for developing fault-tolerant quantum computers and testing quantum theory in complex scenarios. Learn about near-term experimental quantum advantage, examining current evidence supporting the potential of quantum experiments to solve classically intractable problems. Gain insights into classical simulation algorithms for these experiments, with topics covering scrambling properties, polynomial structures, robustness to additive error, and emerging solutions in the field. Part of the 2023 PCMI Graduate Summer School program focusing on quantum computation, this lecture integrates with a comprehensive curriculum including quantum learning, information theory, linear-algebraic algorithms, and quantum error-correcting codes.

Syllabus

Review
The scrambling property
The polynomial structure
Motivation
Robustness to additive error
Paretos answer
A new era
We are not lucky
The trick
What if
New results
Potential solutions

Taught by

IAS | PCMI Park City Mathematics Institute

Reviews

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

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.