On new PageRank computation methods using quantum computing

DOI10.1007/S11128-023-03856-YOpenAlexW4360986079MaRDI QIDQ2693891

Théodore Chapuis-Chkaiban, Benoît Valiron, Zeno Toffano

Publication date: 24 March 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-023-03856-y

zbMATH Keywords

information theoryquantum computingspectral graph theoryPageRankgraph Fourier transform

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scale-free graph with preferential attachment and evolving internal vertex structure
• Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
• An improved quantum principal component analysis algorithm based on the quantum singular threshold method
• Comparing classical and quantum pageranks
• PageRank Beyond the Web
• Search via Quantum Walk
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Traps and Pitfalls of Topic-Biased PageRank
• Discrete Signal Processing on Graphs: Frequency Analysis
• Deeper Inside PageRank
• On the robustness of bucket brigade quantum RAM
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Time-Efficient Quantum Walks for 3-Distinctness

This page was built for publication: On new PageRank computation methods using quantum computing