Search algorithm on strongly regular graph by lackadaisical quantum walk
From MaRDI portal
(Redirected from Publication:6561797)
Recommendations
- Search on vertex-transitive graphs by lackadaisical quantum walk
- Faster search by lackadaisical quantum walk
- Lackadaisical quantum walk for spatial search
- Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices
- Lackadaisical quantum walks with multiple marked vertices
Cites work
- Coins make quantum walks faster
- Discretization of continuous-time quantum walks via the staggered model with Hamiltonians
- Lackadaisical discrete-time quantum walk on Johnson graph
- Laplacian versus adjacency matrix in quantum walk search
- On the relationship between continuous- and discrete-time quantum walk
- Quadratic speedup for finding marked vertices by Quantum walks
- Quantum Algorithms for the Triangle Problem
- Quantum Walk Algorithm for Element Distinctness
- Quantum walks on graphs
- Search on vertex-transitive graphs by lackadaisical quantum walk
- Spatial search and the Dirac equation
- Spatial search on Johnson graphs by discrete-time quantum walk
- Strongly regular graphs, partial geometries and partially balanced designs
- The staggered quantum walk model
- Universal computation by multiparticle quantum walk
This page was built for publication: Search algorithm on strongly regular graph by lackadaisical quantum walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561797)
