Lab Home | Phone | Search
Center for Nonlinear Studies  Center for Nonlinear Studies
 Home 
 People 
 Current 
 Affiliates 
 Alumni 
 Visitors 
 Students 
 Research 
 ICAM-LANL 
 Publications 
 2007 
 2006 
 2005 
 2004 
 2003 
 2002 
 2001 
 2000 
 <1999 
 Conferences 
 Workshops 
 Sponsorship 
 Talks 
 Colloquia 
 Colloquia Archive 
 Seminars 
 Postdoc Seminars Archive 
 Quantum Lunch 
 CMS Colloquia 
 Q-Mat Seminars 
 Q-Mat Seminars Archive 
 Archive 
 Kac Lectures 
 Dist. Quant. Lecture 
 Ulam Scholar 
 Colloquia 
 
 Jobs 
 Students 
 Summer Research 
 Student Application 
 Visitors 
 Description 
 Past Visitors 
 Services 
 General 
 PD Travel Request 
 
 History of CNLS 
 
 Maps, Directions 
 CNLS Office 
 T-Division 
 LANL 
 
Thursday, April 24, 2014
2:00 PM - 3:00 PM
Physics Auditorium, TA-3 Bldg 215

Colloquium

Investigation of a quantum adiabatic algorithm for search engine ranking

Susan Coppersmith
University of Wisconsin, Madison

An important method for search engine result ranking works by finding the principal eigenvector of the "Google matrix." Here, we show that a recently proposed quantum algorithm for preparing this eigenvector has a run-time that depends on features of the graphs other than the degree distribution. For a sample of graphs with degree distributions that more closely resemble the Web than in previous work, the proposed algorithm for eigenvector preparation does not appear to run exponentially faster than the classical case.

Host: Robert Ecke