Quantum Walks with Multiple or Moving Marked Locations

DOI10.1007/978-3-540-77566-9_42zbMath1132.68383OpenAlexW1571674278MaRDI QIDQ5448675

Alexander Rivosh, Andris Ambainis

Publication date: 7 March 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_42

Mathematics Subject Classification ID

Related Items (9)

Spatial search by continuous-time quantum walk with multiple marked vertices ⋮ Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification ⋮ Exceptional quantum walk search on the cycle ⋮ 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 ⋮ Equivalence of Szegedy's and coined quantum walks ⋮ Adjacent Vertices Can Be Hard to Find by Quantum Walks ⋮ On the probability of finding marked connected components using quantum walks ⋮ Faster search of clustered marked states with lackadaisical quantum walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• From quantum cellular automata to quantum lattice gases
• Spatial search and the Dirac equation
• Exponential algorithmic speedup by a quantum walk
• Quantum verification of matrix products
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Quantum Algorithms for the Triangle Problem
• Quantum Walk Algorithm for Element Distinctness

This page was built for publication: Quantum Walks with Multiple or Moving Marked Locations