Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification

DOI10.1007/978-3-642-35656-8_7zbMath1452.68080arXiv1112.3337OpenAlexW2116772490MaRDI QIDQ3455200

Nikolajs Nahimovs, Artūrs Bačkurs, Alexander Rivosh, Raitis Ozols, Andris Ambainis

Publication date: 3 December 2015

Published in: Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

Robust quantum spatial search, Exceptional quantum walk search on the cycle, Quantum circuits for discrete-time quantum walks with position-dependent coin operator, Lackadaisical quantum walk for spatial search, Quantum walk search on a two-dimensional grid with extra edges, Analysis and applications of quantum walks, The quantum walk search algorithm: factors affecting efficiency, Weak Limit Theorem of a Two-phase Quantum Walk with One Defect, Faster search by lackadaisical quantum walk, Quantum walks: a comprehensive review, Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations, Quantum search on Hanoi network, Faster search of clustered marked states with lackadaisical quantum walks, Lackadaisical quantum walks on 2D grids with multiple marked vertices

Cites Work

• From quantum cellular automata to quantum lattice gases
• Spatial search and the Dirac equation
• Finding Is as Easy as Detecting for Quantum Walks
• Quantum Complexity Theory
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Faster quantum-walk algorithm for the two-dimensional spatial search
• Quantum Walks with Multiple or Moving Marked Locations