Quadratic speedup for finding marked vertices by Quantum walks
From MaRDI portal
Publication:5144929
Cited in
(18)- Lackadaisical quantum walks with multiple marked vertices
- Upperbounds on the probability of finding marked connected components using quantum walks
- Spatial search on Johnson graphs by discrete-time quantum walk
- Strong dispersion property for the quantum walk on the hypercube
- Efficient implementation of LIMDDs for quantum circuit simulation
- Improvement of quantum walks search algorithm in single-marked vertex graph
- Lackadaisical discrete-time quantum walk on Johnson graph
- Quadratic speedup for finding marked vertices by quantum walks
- Multidimensional quantum walks
- Search algorithm on strongly regular graph by lackadaisical quantum walk
- Spectral approach to quantum searching on the interpolated Markov chains: the complete bipartite graph
- Non-Markovianity in discrete-time open quantum random walk on arbitrary graphs
- Sensitivity of quantum walk to phase reversal and geometric perturbations: an exploration in complete graphs
- Pulsation of quantum walk on Johnson graph
- Dynamical localization and transport properties of quantum walks on the hexagonal lattice
- Multidimensional quantum walks, with application to k-distinctness
- A unified framework of quantum walk search
- Quantum walk on a line with absorbing boundaries
This page was built for publication: Quadratic speedup for finding marked vertices by Quantum walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144929)
