Quantum computing, entanglement, and invariant theory

Feynman proved (to his satisfaction) that quantum phenomena cannot be modeled with a digital (classical) computer. He then set his sights on developing a "quantum computer" to carry out this modeling. This work lay in obscurity until Shor showed (assuming the existence of a quantum computer) that there are polynomial time quantum algorithms for factoring numbers and solving for discrete logarithms. These results and Grover's algorithm for unordered search have caused a recent surge in interest in this field. In this lecture we will give an idea of the mathematical aspects of quantum, computing (with no of physical implementation), describe a quantum algorithm and attempt to explain some joint work with David Meyer on entanglement.

Refreshments will be served in Math Annex Room 1115, 3:15 p.m.