Pages that link to "Item:Q2411569"
From MaRDI portal
The following pages link to Comparing classical and quantum pageranks (Q2411569):
Displaying 15 items.
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems (Q669949) (← links)
- Qswalk: a \textit {Mathematica} package for quantum stochastic walks on arbitrary graphs (Q1738911) (← links)
- Zero transfer in continuous-time quantum walks (Q2100789) (← links)
- The sensitivity of a quantum PageRank (Q2227312) (← links)
- Quantum walk and its application domains: a systematic review (Q2668386) (← links)
- Discrete-time quantum walk algorithm for ranking nodes on a network (Q2677222) (← links)
- A systematic method to building Dirac quantum walks coupled to electromagnetic fields (Q2684254) (← links)
- On new PageRank computation methods using quantum computing (Q2693891) (← links)
- Limiting properties of stochastic quantum walks on directed graphs (Q4603663) (← links)
- Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks (Q5890031) (← links)
- Ranking nodes in directed networks via continuous-time quantum walks (Q6107742) (← links)
- \textsc{QSWalk.jl}: Julia package for quantum stochastic walks analysis (Q6159542) (← links)
- Complex quantum networks: a topical review (Q6561866) (← links)
- Eigenvalues and threshold resonances of a two-dimensional split-step quantum walk with strong shift (Q6590023) (← links)
- Resolving degeneracies in Google search via quantum stochastic walks (Q6620191) (← links)