Generalized quantum walk search algorithm
From MaRDI portal
Cites work
- Coins make quantum walks faster
- Faster quantum-walk algorithm for the two-dimensional spatial search
- Faster search by lackadaisical quantum walk
- Faster search of clustered marked states with lackadaisical quantum walks
- Grover search with lackadaisical quantum walks
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Lackadaisical quantum walks with multiple marked vertices
- Multi-target quantum walk search on Johnson graph
- Phase matching in quantum searching.
- Quantum walk search for exceptional configurations
- Quantum walk search on a two-dimensional grid with extra edges
- Quantum walks and search algorithms
- Quantum walks on two-dimensional grids with multiple marked locations
- Quantum Walks with Multiple or Moving Marked Locations
- Spatial search and the Dirac equation
This page was built for publication: Generalized quantum walk search algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7404844)