Quantum computation is a fascinating new area that touches upon the foundations of both quantum physics and computer science. Quantum computers can perform certain tasks, such as factoring, exponentially faster than classical computers.

Over the last couple of years, we have achieved a deeper understanding of quantum algorithms in terms of properties of Fourier transforms over discrete groups. This talk will provide a survey of quantum computation from this viewpoint. The talk is intended for a general audience.