Pages that link to "Item:Q2684190"
From MaRDI portal
The following pages link to Upperbounds on the probability of finding marked connected components using quantum walks (Q2684190):
Displaying 7 items.
- Exceptional quantum walk search on the cycle (Q1679371) (← links)
- Optimized search for complex protocols based on entanglement detection (Q2101216) (← links)
- The average search probabilities of discrete-time quantum walks (Q2104770) (← links)
- Quantum algorithm for Dyck language with multiple types of brackets (Q2152087) (← links)
- Classical and quantum algorithms for constructing text from dictionary problem (Q6095516) (← links)
- Spatial search algorithms on graphs with multiple targets using discrete-time quantum walk (Q6159186) (← links)
- Upperbounds on the probability of finding marked connected components using quantum walks (Q6315037) (← links)