Pages that link to "Item:Q332103"
From MaRDI portal
The following pages link to Laplacian versus adjacency matrix in quantum walk search (Q332103):
Displaying 11 items.
- Vertices cannot be hidden from quantum spatial search for almost all random graphs (Q1654045) (← links)
- Exceptional quantum walk search on the cycle (Q1679371) (← links)
- Decoherence and classicalization of continuous-time quantum walks on graphs (Q2104729) (← links)
- Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems (Q5052049) (← links)
- Gluing of graph Laplacians and their spectra (Q5219267) (← links)
- Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks (Q5890031) (← links)
- A new definition of hitting time and an embedded Markov chain in continuous-time quantum walks (Q6098287) (← links)
- Ranking nodes in directed networks via continuous-time quantum walks (Q6107742) (← links)
- Swift chiral quantum walks (Q6161125) (← links)
- Lackadaisical discrete-time quantum walk on Johnson graph (Q6197517) (← links)
- Degenerate perturbation theory to quantum search (Q6492528) (← links)
