Approximate Degree Lower Bounds for Oracle Identification Problems
Squid: Schools for Quantum Information Development via YouTube
Overview
Watch a conference talk from TQC 2023 exploring mathematical frameworks for proving approximate degree lower bounds in oracle identification problems. Delve into the quantum query complexity analysis presented by Nadezhda Voronova, who introduces novel approaches for computing the parity of hidden binary strings. Learn about the application of this framework to ordered search and hidden string problems, demonstrating nearly tight approximate degree lower bounds of Ω(n/log²n). Understand how these bounds extend to weakly unbounded error settings and their implications for quantum query lower bounds. Discover the connection between randomized communication upper bounds for greater-than and equality functions, and their role in establishing these theoretical limits. The presentation, delivered at the 18th Conference on the Theory of Quantum Computation, Communication and Cryptography, advances our understanding of quantum information science's theoretical foundations.
Syllabus
Introduction
Query model
Approximation model
Relation between models
Advantages
Oracle identification problems
Overview
Complexity
Un unbounded area
Audit search
Systems argument
Main idea
For each eye
Lower bounds
Priority
Putting everything together
Summary
Questions
Generality
Taught by
Squid: Schools for Quantum Information Development