Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations

DOI10.1007/978-3-662-49192-8_31zbMath1397.68080arXiv1507.03788OpenAlexW926816759MaRDI QIDQ5890528

Nikolajs Nahimovs, Alexander Rivosh

Publication date: 10 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.03788

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

Spatial search by continuous-time quantum walk with multiple marked vertices ⋮ Exceptional quantum walk search on the cycle ⋮ Upperbounds on the probability of finding marked connected components using quantum walks ⋮ Equivalence of Szegedy's and coined quantum walks ⋮ Adjacent Vertices Can Be Hard to Find by Quantum Walks ⋮ Faster search of clustered marked states with lackadaisical quantum walks

This page was built for publication: Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations