Quantum walks on two-dimensional grids with multiple marked locations
From MaRDI portal
Publication:5895059
Recommendations
Cites work
- Coins make quantum walks faster
- Connecting coined quantum walks with Szegedy's model
- Finding Is as Easy as Detecting for Quantum Walks
- Quantum Walk Algorithm for Element Distinctness
- Quantum verification of matrix products
- Quantum walks and search algorithms
- Search by quantum walks on two-dimensional grid without amplitude amplification
- Spatial search by continuous-time quantum walk with multiple marked vertices
Cited in
(11)- Lackadaisical quantum walks with multiple marked vertices
- Efficient quantum walk on the grid with multiple marked elements
- Spatial search by continuous-time quantum walk with multiple marked vertices
- Quantum walk search on a two-dimensional grid with extra edges
- Quantum Walks with Multiple or Moving Marked Locations
- scientific article; zbMATH DE number 7453158 (Why is no real title available?)
- Adjacent vertices can be hard to find by quantum walks
- Adjacent vertices can be hard to find by quantum walks
- Quantum walks on two-dimensional grids with multiple marked locations
- 有限偶圈图上的 2-嵌入交错量子游荡
- Search by quantum walks on two-dimensional grid without amplitude amplification
This page was built for publication: Quantum walks on two-dimensional grids with multiple marked locations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895059)
