Pages that link to "Item:Q2314211"
From MaRDI portal
The following pages link to Adjacent vertices can be hard to find by quantum walks (Q2314211):
Displaying 8 items.
- Laplacian versus adjacency matrix in quantum walk search (Q332103) (← links)
- Vertices cannot be hidden from quantum spatial search for almost all random graphs (Q1654045) (← links)
- Exceptional quantum walk search on the cycle (Q1679371) (← links)
- Fast quantum search of multiple vertices based on electric circuits (Q2107944) (← links)
- Upperbounds on the probability of finding marked connected components using quantum walks (Q2684190) (← links)
- Finding Is as Easy as Detecting for Quantum Walks (Q3587406) (← links)
- Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations (Q5895059) (← links)
- Spatial search algorithms on graphs with multiple targets using discrete-time quantum walk (Q6159186) (← links)