6 research outputs found
Asynchronous iterative computations with Web information retrieval structures: The PageRank case
There are several ideas being used today for Web information retrieval, and
specifically in Web search engines. The PageRank algorithm is one of those that
introduce a content-neutral ranking function over Web pages. This ranking is
applied to the set of pages returned by the Google search engine in response to
posting a search query. PageRank is based in part on two simple common sense
concepts: (i)A page is important if many important pages include links to it.
(ii)A page containing many links has reduced impact on the importance of the
pages it links to. In this paper we focus on asynchronous iterative schemes to
compute PageRank over large sets of Web pages. The elimination of the
synchronizing phases is expected to be advantageous on heterogeneous platforms.
The motivation for a possible move to such large scale distributed platforms
lies in the size of matrices representing Web structure. In orders of
magnitude: pages with nonzero elements and bytes
just to store a small percentage of the Web (the already crawled); distributed
memory machines are necessary for such computations. The present research is
part of our general objective, to explore the potential of asynchronous
computational models as an underlying framework for very large scale
computations over the Grid. The area of ``internet algorithmics'' appears to
offer many occasions for computations of unprecedent dimensionality that would
be good candidates for this framework.Comment: 8 pages to appear at ParCo2005 Conference Proceeding
Universal Programmable Quantum Circuit Schemes to Emulate an Operator
Unlike fixed designs, programmable circuit designs support an infinite number
of operators. The functionality of a programmable circuit can be altered by
simply changing the angle values of the rotation gates in the circuit. Here, we
present a new quantum circuit design technique resulting in two general
programmable circuit schemes. The circuit schemes can be used to simulate any
given operator by setting the angle values in the circuit. This provides a
fixed circuit design whose angles are determined from the elements of the given
matrix-which can be non-unitary-in an efficient way. We also give both the
classical and quantum complexity analysis for these circuits and show that the
circuits require a few classical computations. They have almost the same
quantum complexities as non-general circuits. Since the presented circuit
designs are independent from the matrix decomposition techniques and the global
optimization processes used to find quantum circuits for a given operator, high
accuracy simulations can be done for the unitary propagators of molecular
Hamiltonians on quantum computers. As an example, we show how to build the
circuit design for the hydrogen molecule.Comment: combined with former arXiv:1207.174
structures: The PageRank case
Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher mentioned above