Pages that link to "Item:Q2971139"
From MaRDI portal
The following pages link to Adjacent Vertices Can Be Hard to Find by Quantum Walks (Q2971139):
Displaying 6 items.
- Exceptional quantum walk search on the cycle (Q1679371) (← links)
- On the probability of finding marked connected components using quantum walks (Q1992115) (← links)
- Impact of the malicious input data modification on the efficiency of quantum spatial search (Q2681025) (← links)
- Upperbounds on the probability of finding marked connected components using quantum walks (Q2684190) (← links)
- Spatial search algorithms on graphs with multiple targets using discrete-time quantum walk (Q6159186) (← links)
- Quantum walk search for exceptional configurations (Q6634675) (← links)
