Adjacent vertices can be hard to find by quantum walks

DOI10.3103/S0278641919010060zbMath1423.68188OpenAlexW3023538653WikidataQ127930271 ScholiaQ127930271MaRDI QIDQ2314211

K. R. Khadiev, Nikolajs Nahimovs, Raqueline Azevedo Medeiros Santos

Publication date: 19 July 2019

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641919010060

zbMATH Keywords

quantum algorithmsgraph theoryquantum walkssearch problem

Mathematics Subject Classification ID

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

Related Items (1)

Upperbounds on the probability of finding marked connected components using quantum walks

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum Finite Automata: A Modern Introduction
• Quantum Computation and Quantum Information
• UNDERSTANDING QUANTUM ALGORITHMS VIA QUERY COMPLEXITY
• Quantum walks and search algorithms

This page was built for publication: Adjacent vertices can be hard to find by quantum walks