Explore the intricacies of quantum query complexity in this comprehensive lecture from Carnegie Mellon University's Quantum Computation course. Delve into the query complexity model, cost model, and their significance in quantum computing. Examine the notation changes and access methods to input in quantum systems. Analyze various examples, including decision problems, Simon's problem, and collision detection. Investigate lower bounds and element distinctness in quantum algorithms. Gain valuable insights from Professor Ryan O'Donnell's expert instruction in this 81-minute session, part of the Fall 2018 CMU course 15-859BB.
Quantum Query Complexity - Quantum Computation at CMU
Overview
Syllabus
Introduction
Query Complexity Model
Cost Model
Why study this model
Simple model
Changing notation
Access to the input
Examples
Decision problems
Notation
Decisions
Simon
Collision
Lower Flower
Element Distinctness
Taught by
Ryan O'Donnell
Related Courses
-
Understanding and Measuring One Qubit - Lecture 3 of Quantum Computation and Information at CMU
-
Quantum Complexity - Quantum Computation at CMU
-
Shor's Factoring Algorithm - Lecture 16 of Quantum Computation at CMU
-
On Finding Quantum Multi-Collisions
-
Basics of Quantum Computing - Lecture 10 of Quantum Computation at CMU
-
Approximate Degree Lower Bounds for Oracle Identification Problems
