Condensed Matter Physics Seminar
2 p.m., Thursday, February 24, 2005
Room 1201, Physics Building
Quantum Pattern Recognition
Bob Joynt
(University of Wisconsin)
Abstract: The key driving force for research in quantum computation
is the existence of fast quantum algorithms for hard problems. I will outline a
quantum approach to solving the graph isomorphism problem, which plays a central
role in the theory of computational complexity. No polynomialtime algorithm for
solving GI is known. We have discovered that the dynamics of many quantum
particles on graphs, specifically hardcore bosons, is a powerful tool for
distinguishing similar graphs.

Host: Chubukov
Back to Condensed Matter Physics Seminar Home
Page