Lab Home | Phone | Search
Center for Nonlinear Studies  Center for Nonlinear Studies
 Colloquia Archive 
 Postdoc Seminars Archive 
 Quantum Lunch 
 Quantum Lunch Archive 
 CMS Colloquia 
 Q-Mat Seminars 
 Q-Mat Seminars Archive 
 P/T Colloquia 
 Kac Lectures 
 Kac Fellows 
 Dist. Quant. Lecture 
 Ulam Scholar 
 CNLS Fellowship Application 
 Student Program 
 Past Visitors 
 History of CNLS 
 Maps, Directions 
 CNLS Office 
Thursday, April 24, 2014
2:00 PM - 3:00 PM
Physics Auditorium, TA-3 Bldg 215


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