YoVDO

Have We Seen a Demonstration of Experimental Quantum Advantage? - IPAM at UCLA

Offered By: Institute for Pure & Applied Mathematics (IPAM) via YouTube

Tags

Quantum Computing Courses Computational Complexity Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the latest developments in experimental quantum advantage claims and their classical hardness in this lecture from the University of Chicago's Bill Fefferman. Delve into the complexity theoretic results supporting the potential quantum advantage of near-term, random quantum circuit experiments over efficient classical algorithms. Examine the current gaps between theory and practice, with a particular focus on understanding how uncorrected noise in near-term quantum experiments might be exploited by fast classical simulation algorithms. Gain insights into the ongoing debate surrounding quantum supremacy and the challenges of demonstrating true quantum advantage in practical applications.

Syllabus

Bill Fefferman - Have we seen a demonstration of experimental quantum advantage? - IPAM at UCLA


Taught by

Institute for Pure & Applied Mathematics (IPAM)

Related Courses

Automata Theory
Stanford University via edX
Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX
算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera
How to Win Coding Competitions: Secrets of Champions
ITMO University via edX
Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera