TIME: 1:30 -- 2:30 pm, Tuesday, Feb 24, 2009 SPECIAL PLACE: CSE 503 SPEAKER: Dave Bacon, University of Washington TITLE: Symmetry in Quantum Algorithms ABSTRACT: Quantum computers can outperform their classical brethren at a variety of algorithmic tasks. Uncovering exactly when quantum computers can exponentially outperform classical computers is one of the central questions facing the theory of quantum algorithms today. In this talk I will argue that a key piece of this puzzle is the role played by symmetry in quantum algorithms. I will show how this point of view can be used to make progress in finding new quantum algorithms. This talk will assume no prior knowledge of quantum theory, but hopefully by the end of the talk you will have enough to begin to understand quantum algorithms.