Quantum walks on two-dimensional grids with multiple marked locations
From MaRDI portal
Publication:5895059
DOI10.1142/S0129054118410113zbMATH Open1397.68081WikidataQ129591506 ScholiaQ129591506MaRDI QIDQ5895059FDOQ5895059
Authors: Nikolajs Nahimovs, Alexander Rivosh 
Publication date: 24 July 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Coins make quantum walks faster
- Quantum verification of matrix products
- Finding Is as Easy as Detecting for Quantum Walks
- Quantum Walk Algorithm for Element Distinctness
- Quantum walks and search algorithms
- Spatial search by continuous-time quantum walk with multiple marked vertices
- Connecting coined quantum walks with Szegedy's model
- Search by quantum walks on two-dimensional grid without amplitude amplification
Cited In (11)
- Lackadaisical quantum walks with multiple marked vertices
- Efficient quantum walk on the grid with multiple marked elements
- Quantum walk search on a two-dimensional grid with extra edges
- Spatial search by continuous-time quantum walk with multiple marked vertices
- Quantum Walks with Multiple or Moving Marked Locations
- Title not available (Why is that?)
- Quantum walks on two-dimensional grids with multiple marked locations
- Adjacent vertices can be hard to find by quantum walks
- Adjacent vertices can be hard to find by quantum walks
- 有限偶圈图上的 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)
