On new PageRank computation methods using quantum computing
From MaRDI portal
Recommendations
- Comparing classical and quantum pageranks
- The sensitivity of a quantum PageRank
- On accelerating the PageRank computation
- A new extrapolation method for PageRank computations
- Accelerating PageRank computations
- scientific article; zbMATH DE number 2086529
- A Survey on PageRank Computing
- Parallelizing the Computation of PageRank
Cites work
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- An improved quantum principal component analysis algorithm based on the quantum singular threshold method
- Comparing classical and quantum pageranks
- Deeper Inside PageRank
- Discrete Signal Processing on Graphs: Frequency Analysis
- Emergence of Scaling in Random Networks
- Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
- On the robustness of bucket brigade quantum RAM
- PageRank beyond the web
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Scale-free graph with preferential attachment and evolving internal vertex structure
- Search via Quantum Walk
- Statistical mechanics of complex networks
- Time-efficient quantum walks for 3-distinctness
- Traps and Pitfalls of Topic-Biased PageRank
Cited in
(5)- The sensitivity of a quantum PageRank
- Comparing classical and quantum pageranks
- Quantum hub and authority centrality measures for directed networks based on continuous-time quantum walks
- Resolving degeneracies in Google search via quantum stochastic walks
- Discrete-time quantum walk algorithm for ranking nodes on a network
This page was built for publication: On new PageRank computation methods using quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693891)
