A Quantum Query Complexity Trichotomy for Regular Languages
Offered By: IEEE via YouTube
Course Description
Overview
Explore a groundbreaking 22-minute IEEE conference talk that delves into the quantum query complexity of regular languages. Join renowned experts Scott Aaronson, Daniel Grier, and Luke Schaeffer as they present their findings on a trichotomy in this fascinating area of quantum computing research. Gain insights into the intersection of quantum complexity theory and formal language theory, and discover how this work contributes to our understanding of quantum algorithms and their potential advantages over classical counterparts.
Syllabus
A Quantum Query Complexity Trichotomy for Regular Languages
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Automata TheoryStanford University via edX Introduction to Automata, Languages and Computation
Indian Institute of Technology, Kharagpur via Swayam Theory of Computation
NPTEL via YouTube Deterministic Finite Automata
Ryan O'Donnell via YouTube Great Ideas in Theoretical Computer Science: Finite Automata
Ryan O'Donnell via YouTube