Quadratic speedup for finding marked vertices by Quantum walks

DOI10.1145/3357713.3384252OpenAlexW3035494902MaRDI QIDQ5144929

Stacey Jeffery, Unnamed Author, Martins Kokainis, Andris Ambainis

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

Markov chainsquantum algorithmsquantum walksquantum searchsearch by random walk

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (6)

Spatial search on Johnson graphs by discrete-time quantum walk ⋮ Efficient implementation of LIMDDs for quantum circuit simulation ⋮ Improvement of quantum walks search algorithm in single-marked vertex graph ⋮ Upperbounds on the probability of finding marked connected components using quantum walks ⋮ Lackadaisical discrete-time quantum walk on Johnson graph ⋮ Strong dispersion property for the quantum walk on the hypercube

This page was built for publication: Quadratic speedup for finding marked vertices by Quantum walks