Eduardo Sánchez-Burillo, Jordi Duch, Jesús Gómez-Gardenes, David Zueco
Navigating networks comprising the interdependencies between the elements of
large complex systems and databases has been shown as a useful tool for ranking
the importance that these constituents have on their global organization. A key
example is Pagerank navigation which is at the core of the most used search
engine of the World Wide Web. With the advent of quantum technologies we have
learnt that some classical tasks can be outperformed when quantum rules enter
into play. Here we show that it is possible to define a quantum navigation
providing a unique ranking reflecting the network topology. We demonstrate that
the computation of this quantum ranking is faster and solves degeneracies of
classical ranks. Moreover, we show that quantum coherence captures a more
global view of the interdependencies between elements, highlighting new
hierarchical features. Contrary to the usual quantum algorithms, our quantum
rank does not need a quantum computer, and we show its implementation in real
networks.
View original:
http://arxiv.org/abs/1202.3471
No comments:
Post a Comment