Pages that link to "Item:Q262276"
From MaRDI portal
The following pages link to Quantum walks can find a marked element on any graph (Q262276):
Displaying 29 items.
- Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model (Q291465) (← links)
- Spatial search by continuous-time quantum walk with multiple marked vertices (Q291466) (← links)
- Szegedy's quantum walk with queries (Q513418) (← links)
- A note on the search for \(k\) elements via quantum walk (Q1675772) (← links)
- Exceptional quantum walk search on the cycle (Q1679371) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Faster search by lackadaisical quantum walk (Q1746914) (← links)
- On the probability of finding marked connected components using quantum walks (Q1992115) (← links)
- A quantum searching model finding one of the edges of a subgraph in a complete graph (Q2101204) (← links)
- The average search probabilities of discrete-time quantum walks (Q2104770) (← links)
- Periodicity of lively quantum walks on cycles with generalized Grover coin (Q2197217) (← links)
- Adjacent vertices can be hard to find by quantum walks (Q2314211) (← links)
- Efficient quantum circuits for Szegedy quantum walks (Q2362658) (← links)
- On the hitting times of quantum versus random walks (Q2429358) (← links)
- Upperbounds on the probability of finding marked connected components using quantum walks (Q2684190) (← links)
- Quantum search of matching on signed graphs (Q2690254) (← links)
- Circuit implementation of discrete-time quantum walks via the shunt decomposition method (Q2693901) (← links)
- Finding Is as Easy as Detecting for Quantum Walks (Q3587406) (← links)
- Quantum-walk speedup of backtracking algorithms (Q4612479) (← links)
- Efficient quantum walk on the grid with multiple marked elements (Q4636641) (← links)
- (Q5075742) (← links)
- Quantum mixing of Markov chains for special distributions (Q5144028) (← links)
- Topological classification of time-asymmetry in unitary quantum processes (Q5874144) (← links)
- Finding more than one path through a simple maze with a quantum walk (Q5876647) (← links)
- Improvement of quantum walks search algorithm in single-marked vertex graph (Q6096899) (← links)
- A novel image segmentation algorithm based on continuous-time quantum walk using superpixels (Q6145455) (← links)
- Optimal deterministic quantum algorithm for the promised element distinctness problem (Q6496884) (← links)
- Spectral approach to quantum searching on the interpolated Markov chains: the complete bipartite graph (Q6566184) (← links)
- Recovering the original simplicity: succinct and exact quantum algorithm for the welded tree problem (Q6647776) (← links)