Pages that link to "Item:Q262276"

The following pages link to Quantum walks can find a marked element on any graph (Q262276):

Displaying 15 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)
• 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)
• Periodicity of lively quantum walks on cycles with generalized Grover coin (Q2197217) (← links)
• Efficient quantum circuits for Szegedy quantum walks (Q2362658) (← links)
• Circuit implementation of discrete-time quantum walks via the shunt decomposition method (Q2693901) (← links)
• (Q4612479) (← links)
• (Q5075742) (← links)
• Topological classification of time-asymmetry in unitary quantum processes (Q5874144) (← 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)