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

YouTube

Algorithmic Dual to the Adversary Method in Quantum Query Complexity - Part 5

IAS | PCMI Park City Mathematics Institute via YouTube

Overview

Learn about quantum query complexity through this 59-minute lecture that explores the algorithmic dual to the adversary method. Delve into fundamental lower bound techniques in quantum computing, including polynomial and adversary methods, while examining their new variants like the compressed oracle technique. Discover how duals in these methods can lead to tight bounds and innovative algorithms. Explore topics such as SDP viewpoint, angle detection, inner product analysis, learning graphs, and flows as part of the 2023 IAS PCMI Graduate Summer School program on Quantum Computation. Access accompanying lecture notes and problem session materials that provide deeper insights into the adversary method and its dual applications in quantum query complexity.

Syllabus

Introduction
Sdp viewpoint
Theorem
Angle detection
Proof
Inner product
Two Lemma
First Limit
Learning Graph
Powerset
One certificate
Flows
Solution

Taught by

IAS | PCMI Park City Mathematics Institute

Reviews

Start your review of Algorithmic Dual to the Adversary Method in Quantum Query Complexity - Part 5

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.