Comparing classical and quantum pageranks
From MaRDI portal
Publication:2411569
DOI10.1007/s11128-016-1456-zzbMath1373.81114arXiv1511.04823OpenAlexW2286055517MaRDI QIDQ2411569
Publication date: 24 October 2017
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.04823
Quantum stochastic calculus (81S25) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Random walks on graphs (05C81)
Related Items (11)
Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks ⋮ Quantum walk and its application domains: a systematic review ⋮ Discrete-time quantum walk algorithm for ranking nodes on a network ⋮ Ranking nodes in directed networks via continuous-time quantum walks ⋮ A systematic method to building Dirac quantum walks coupled to electromagnetic fields ⋮ \textsc{QSWalk.jl}: Julia package for quantum stochastic walks analysis ⋮ Limiting properties of stochastic quantum walks on directed graphs ⋮ On new PageRank computation methods using quantum computing ⋮ A quantum walk-assisted approximate algorithm for bounded NP optimisation problems ⋮ Qswalk: a \textit {Mathematica} package for quantum stochastic walks on arbitrary graphs ⋮ Zero transfer in continuous-time quantum walks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Open quantum systems. An introduction.
- Efficient quantum circuits for Szegedy quantum walks
- Quantum Computation and Quantum Information
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Scale-Free Networks: A Decade and Beyond
- Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
- Directed scale-free graphs
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Quantum walks on graphs
- Random Graphs
This page was built for publication: Comparing classical and quantum pageranks
