Spatial search by continuous-time quantum walk with multiple marked vertices
From MaRDI portal
Publication:291466
DOI10.1007/S11128-015-1239-YzbMath1338.81152arXiv1501.07071OpenAlexW3104135805MaRDI QIDQ291466
Publication date: 10 June 2016
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.07071
Searching and sorting (68P10) Sums of independent random variables; random walks (60G50) Quantum computation (81P68)
Related Items (10)
Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems ⋮ Laplacian versus adjacency matrix in quantum walk search ⋮ Vertices cannot be hidden from quantum spatial search for almost all random graphs ⋮ Quantum walk and its application domains: a systematic review ⋮ Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term ⋮ Adjacent Vertices Can Be Hard to Find by Quantum Walks ⋮ Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations ⋮ Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices ⋮ Faster search of clustered marked states with lackadaisical quantum walks ⋮ Fast quantum search of multiple vertices based on electric circuits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum walks can find a marked element on any graph
- From quantum cellular automata to quantum lattice gases
- On the absence of homogeneous scalar unitary cellular automata.
- Diagrammatic approach to quantum search
- Quantum walk search through potential barriers
- Grover search with lackadaisical quantum walks
- Quantum Walks with Multiple or Moving Marked Locations
- Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations
This page was built for publication: Spatial search by continuous-time quantum walk with multiple marked vertices
