Adjacent Vertices Can Be Hard to Find by Quantum Walks

DOI10.1007/978-3-319-51963-0_20zbMath1423.68187arXiv1605.05598OpenAlexW2400063867MaRDI QIDQ2971139

Nikolajs Nahimovs, Raqueline Azevedo Medeiros Santos

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

hypercubestationary statesquantum walksmultiple marked verticesquantum searchtwo-dimensional gridgeneral graphsexceptional configurations

Mathematics Subject Classification ID

Random walks on graphs (05C81) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

Exceptional quantum walk search on the cycle ⋮ Impact of the malicious input data modification on the efficiency of quantum spatial search ⋮ Upperbounds on the probability of finding marked connected components using quantum walks ⋮ Spatial search algorithms on graphs with multiple targets using discrete-time quantum walk ⋮ On the probability of finding marked connected components using quantum walks

Cites Work

• Unnamed Item
• The staggered quantum walk model
• Spatial search by continuous-time quantum walk with multiple marked vertices
• Quantum Algorithms for the Triangle Problem
• Quantum Walks with Multiple or Moving Marked Locations
• Quantum Walk Algorithm for Element Distinctness
• Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations
• Quantum walks and search algorithms

This page was built for publication: Adjacent Vertices Can Be Hard to Find by Quantum Walks