Resolving degeneracies in Google search via quantum stochastic walks

Resolving degeneracies in Google search via quantum stochastic walks

Journal of Statistical Mechanics: Theory and Experiment (2024) 013402 The Internet is one of the most valuable technologies invented to date. Among them, Google is the most widely used search engine. The PageRank algorithm is the backbone of Google search, ranking web pages according to relevance an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Benjamin, Colin, Dudhe, Naini
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Social and Information Networks
Computer Science - Systems and Control
Physics - Computational Physics
Physics - Disordered Systems and Neural Networks
Physics - Quantum Physics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Benjamin, Colin
Dudhe, Naini
description Journal of Statistical Mechanics: Theory and Experiment (2024) 013402 The Internet is one of the most valuable technologies invented to date. Among them, Google is the most widely used search engine. The PageRank algorithm is the backbone of Google search, ranking web pages according to relevance and recency. We employ quantum stochastic walks (QSWs) to improve the classical PageRank (CPR) algorithm based on classical continuous time random walks. We implement QSW via two schemes: only incoherence and dephasing with incoherence. PageRank using QSW with only incoherence or QSW with dephasing and incoherence best resolves degeneracies that are unresolvable via CPR and with a convergence time comparable to that for CPR, which is generally the minimum. For some networks, the two QSW schemes obtain a convergence time lower than CPR and an almost degeneracy-free ranking compared to CPR.
doi_str_mv 10.48550/arxiv.2207.11429
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2207_11429</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2207_11429</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-a16b52f745d6c6c6475b5e15e5624a82df7db5f390152691e5dc1983baddfa293</originalsourceid><addsrcrecordid>eNotz7FOwzAUhWEvDKjwAEz4BRJix9eOR1SgIFVCQt2jG_s6tUgTsNMAbw8UdIZ_O9LH2JWoStUAVDeYPuNSSlmZUggl7Tm7e6E8DUsce-6pp5ESukiZx5FvpqkfiGfC5PZ8icjfjzjOxwPP8-T2mOfo-AcOr_mCnQUcMl3-d8V2D_e79WOxfd48rW-3BWpjCxS6AxmMAq_dz5SBDkgAgZYKG-mD8R2E2lYCpLaCwDthm7pD7wNKW6_Y9d_tidG-pXjA9NX-ctoTp_4GoNJFuQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Resolving degeneracies in Google search via quantum stochastic walks</title><source>arXiv.org</source><creator>Benjamin, Colin ; Dudhe, Naini</creator><creatorcontrib>Benjamin, Colin ; Dudhe, Naini</creatorcontrib><description>Journal of Statistical Mechanics: Theory and Experiment (2024) 013402 The Internet is one of the most valuable technologies invented to date. Among them, Google is the most widely used search engine. The PageRank algorithm is the backbone of Google search, ranking web pages according to relevance and recency. We employ quantum stochastic walks (QSWs) to improve the classical PageRank (CPR) algorithm based on classical continuous time random walks. We implement QSW via two schemes: only incoherence and dephasing with incoherence. PageRank using QSW with only incoherence or QSW with dephasing and incoherence best resolves degeneracies that are unresolvable via CPR and with a convergence time comparable to that for CPR, which is generally the minimum. For some networks, the two QSW schemes obtain a convergence time lower than CPR and an almost degeneracy-free ranking compared to CPR.</description><identifier>DOI: 10.48550/arxiv.2207.11429</identifier><language>eng</language><subject>Computer Science - Social and Information Networks ; Computer Science - Systems and Control ; Physics - Computational Physics ; Physics - Disordered Systems and Neural Networks ; Physics - Quantum Physics</subject><creationdate>2022-07</creationdate><rights>http://creativecommons.org/licenses/by-nc-nd/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2207.11429$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.1088/1742-5468/ad1384$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2207.11429$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Benjamin, Colin</creatorcontrib><creatorcontrib>Dudhe, Naini</creatorcontrib><title>Resolving degeneracies in Google search via quantum stochastic walks</title><description>Journal of Statistical Mechanics: Theory and Experiment (2024) 013402 The Internet is one of the most valuable technologies invented to date. Among them, Google is the most widely used search engine. The PageRank algorithm is the backbone of Google search, ranking web pages according to relevance and recency. We employ quantum stochastic walks (QSWs) to improve the classical PageRank (CPR) algorithm based on classical continuous time random walks. We implement QSW via two schemes: only incoherence and dephasing with incoherence. PageRank using QSW with only incoherence or QSW with dephasing and incoherence best resolves degeneracies that are unresolvable via CPR and with a convergence time comparable to that for CPR, which is generally the minimum. For some networks, the two QSW schemes obtain a convergence time lower than CPR and an almost degeneracy-free ranking compared to CPR.</description><subject>Computer Science - Social and Information Networks</subject><subject>Computer Science - Systems and Control</subject><subject>Physics - Computational Physics</subject><subject>Physics - Disordered Systems and Neural Networks</subject><subject>Physics - Quantum Physics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz7FOwzAUhWEvDKjwAEz4BRJix9eOR1SgIFVCQt2jG_s6tUgTsNMAbw8UdIZ_O9LH2JWoStUAVDeYPuNSSlmZUggl7Tm7e6E8DUsce-6pp5ESukiZx5FvpqkfiGfC5PZ8icjfjzjOxwPP8-T2mOfo-AcOr_mCnQUcMl3-d8V2D_e79WOxfd48rW-3BWpjCxS6AxmMAq_dz5SBDkgAgZYKG-mD8R2E2lYCpLaCwDthm7pD7wNKW6_Y9d_tidG-pXjA9NX-ctoTp_4GoNJFuQ</recordid><startdate>20220723</startdate><enddate>20220723</enddate><creator>Benjamin, Colin</creator><creator>Dudhe, Naini</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220723</creationdate><title>Resolving degeneracies in Google search via quantum stochastic walks</title><author>Benjamin, Colin ; Dudhe, Naini</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-a16b52f745d6c6c6475b5e15e5624a82df7db5f390152691e5dc1983baddfa293</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Social and Information Networks</topic><topic>Computer Science - Systems and Control</topic><topic>Physics - Computational Physics</topic><topic>Physics - Disordered Systems and Neural Networks</topic><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Benjamin, Colin</creatorcontrib><creatorcontrib>Dudhe, Naini</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Benjamin, Colin</au><au>Dudhe, Naini</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Resolving degeneracies in Google search via quantum stochastic walks</atitle><date>2022-07-23</date><risdate>2022</risdate><abstract>Journal of Statistical Mechanics: Theory and Experiment (2024) 013402 The Internet is one of the most valuable technologies invented to date. Among them, Google is the most widely used search engine. The PageRank algorithm is the backbone of Google search, ranking web pages according to relevance and recency. We employ quantum stochastic walks (QSWs) to improve the classical PageRank (CPR) algorithm based on classical continuous time random walks. We implement QSW via two schemes: only incoherence and dephasing with incoherence. PageRank using QSW with only incoherence or QSW with dephasing and incoherence best resolves degeneracies that are unresolvable via CPR and with a convergence time comparable to that for CPR, which is generally the minimum. For some networks, the two QSW schemes obtain a convergence time lower than CPR and an almost degeneracy-free ranking compared to CPR.</abstract><doi>10.48550/arxiv.2207.11429</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2207.11429
ispartof
issn
language eng
recordid cdi_arxiv_primary_2207_11429
source arXiv.org
subjects Computer Science - Social and Information Networks
Computer Science - Systems and Control
Physics - Computational Physics
Physics - Disordered Systems and Neural Networks
Physics - Quantum Physics
title Resolving degeneracies in Google search via quantum stochastic walks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-21T05%3A36%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Resolving%20degeneracies%20in%20Google%20search%20via%20quantum%20stochastic%20walks&rft.au=Benjamin,%20Colin&rft.date=2022-07-23&rft_id=info:doi/10.48550/arxiv.2207.11429&rft_dat=%3Carxiv_GOX%3E2207_11429%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true