Towards Optimal Separations between Quantum and Randomized Query Complexities
Offered By: IEEE via YouTube
Course Description
Overview
Explore a comprehensive lecture on the advancements in separating quantum and randomized query complexities. Delve into the latest research findings presented by Avishay Tal from UC Berkeley, as he discusses the ongoing efforts to achieve optimal distinctions between these two computational models. Gain insights into the theoretical foundations and practical implications of this cutting-edge work in quantum computing and complexity theory.
Syllabus
Towards Optimal Separations between Quantum and Randomized Query Complexities
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Approximation Algorithms Part IÉcole normale supérieure via Coursera Approximation Algorithms Part II
École normale supérieure via Coursera Automata Theory
Stanford University via edX Computation in Complex Systems
Santa Fe Institute via Complexity Explorer Computing: Art, Magic, Science
ETH Zurich via edX