[Colloq] Math seminar, Tue, Nov 3: The hunt for a quantum algorithm for Graph Isomorphism

Rajmohan Rajaraman rraj at ccs.neu.edu
Fri Oct 30 10:54:55 EDT 2015


Announcing a talk next Tuesday by our visitor Cris Moore on the hunt for a quantum algorithm for Graph Isomorphism.  

Best,

Rajmohan.

----- On Oct 30, 2015, at 8:46 AM, r r.mcowen at neu.edu wrote:

Applied and Interdisciplinary Mathematics Seminar

Location: 511 Lake Hall, Northeastern University
Date: Tuesday, November 3, 2015
 Time: 12:00 - 1:00pm
(NOTE UNUSUAL TIME!)

Speaker: Cris Moore (Santa Fe Institute)

Title: The hunt for a quantum algorithm for Graph Isomorphism

After Shor discovered his quantum algorithm for factoring, many of us were hopeful that a similar algorithm could work for Graph Isomorphism.  Our hopes were dashed --- but dashed beautifully, by the representation theory of the symmetric group (to which I will give a friendly introduction).  As a result, we now know that no quantum algorithm remotely similar to Shor's will solve this problem.

This is joint work with several people, but I'll focus on joint work with Alex Russell and Leonard Schulman.

Seminar Website: http://www.northeastern.edu/mcowen/AIMseminar.html

Note: If you wish to be removed from this email list, please contact Robert McOwen: r.mcowen at neu.edu<mailto:r.mcowen at neu.edu>



More information about the Colloq mailing list