Computer Science/Discrete Mathematics Seminar II

Shor's algorithm, the hallmark quantum algorithmic breakthrough, has been successfully generalized to address a variety of related algebraic problems. Generalizations to nonabelian settings could have striking consequences, but such efforts have been systematically frustrated. This talk describes a rigorous obstruction to such natural generalizations and the connection to Graph Isomorphism. Along the way, we will give a friendly introduction to one of the gems of 19th century mathematics: the representation theory of finite groups.