Adam Frees, John King Gamble, Kenneth Rudinger, Eric Bach, Mark Friesen, Robert Joynt, S. N. Coppersmith
An important method for search engine result ranking works by finding the principal eigenvector of the "Google matrix." Recently, a quantum algorithm for this problem and evidence of an exponential speedup for some scale-free networks were presented. Here, we show that the run-time depends on features of the graphs other than the degree distribution, and can be altered sufficiently to rule out a general exponential speedup. For a sample of graphs with degree distributions that more closely resemble the Web than in previous work, the proposed algorithm does not appear to run exponentially faster than the classical case.
View original:
http://arxiv.org/abs/1211.2248
No comments:
Post a Comment