Does the Google PageRank Algorithm Face a Quantum Threat?
December 23, 2011
One of the reasons that Google holds the title of the world’s leading search engine is due in large part to its PageRank algorithm. Other companies have tried to create algorithms to out compete the search giant but all have failed — until now.
According to the recent Technology Review article “Quantam PageRank Algorithm Outperforms Classical Version,” last week, Giuseppe Paparo and Miguel Martín-Delgado at The Complutense University in Madrid revealed a contender to Google’s original algorithm.
The article states:
With a tree graph, the quantum algorithm outperforms the classical algorithm in ranking the root page. However, although the algorithms average ranking of other pages produces the same hierarchy as a classical network, the quantum hierarchy may be different at any specific instant. This reflects the quantum fluctuations that can occur in these kinds of experiments. For a directed graph, the results are similar. The quantum algorithm spots the highest ranking page much more quickly than a classical algorithm but it only matches the classical hierarchy of other pages on average.
If Paparo, Martin-Delgado, and others continue to perfect quantum search, Google may lose its claim to the search engine throne more quickly than we anticipated.
Jasmine Ashton, December 23, 2011
Sponsored by Pandia.com
Comments
One Response to “Does the Google PageRank Algorithm Face a Quantum Threat?”
-
- Subscribe to Beyond Search
Feature archive
News archive
-
[…] Does the Google PageRank Algorithm Face a Quantum Threat? (arnoldit.com) […]