Power-law scaling for the adiabatic algorithm for search-engine ranking
نویسندگان
چکیده
منابع مشابه
Power-law scaling for the adiabatic algorithm for search-engine ranking
Adam Frees,1 John King Gamble,2 Kenneth Rudinger,2 Eric Bach,3 Mark Friesen,2,* Robert Joynt,2 and S. N. Coppersmith2,† 1Department of Physics, Brown University, Providence, Rhode Island 02912, USA 2Department of Physics, University of Wisconsin-Madison, Madison, Wisconsin 53706, USA 3Department of Computer Sciences, University of Wisconsin-Madison, Madison, Wisconsin 53706, USA (Received 11 De...
متن کاملAdiabatic quantum algorithm for search engine ranking.
We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web page...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSearch Engine-inspired Ranking Algorithm for Trading Networks
Received Jan 7, 2018 Revised Feb 16, 2018 Accepted Feb 22, 2018 Ranking algorithms based on link structure of the network are well-known methods in web search engines to improve the quality of the searches. The most famous ones are PageRank and HITS. PageRank uses probability of random surfers to visit a page as the score of that page, and HITS instead of produces one score, proposes using two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2013
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.88.032307