Faster search by lackadaisical quantum walk
From MaRDI portal
Publication:1746914
DOI10.1007/s11128-018-1840-yzbMath1386.81051arXiv1706.06939OpenAlexW2654805423MaRDI QIDQ1746914
Publication date: 26 April 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.06939
Searching and sorting (68P10) Sums of independent random variables; random walks (60G50) Quantum computation (81P68)
Related Items (13)
Quantum walk and its application domains: a systematic review ⋮ Quantum abstract detecting systems ⋮ Search on vertex-transitive graphs by lackadaisical quantum walk ⋮ Quantum walks for the determination of commutativity of finite dimensional algebras ⋮ Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term ⋮ Lackadaisical quantum walk for spatial search ⋮ Probability and entanglement evolutions for Szegedy's quantum search on the one-dimensional cycle with self-loops ⋮ Quantum walk search on a two-dimensional grid with extra edges ⋮ On a poset of quantum exact promise problems ⋮ Lackadaisical discrete-time quantum walk on Johnson graph ⋮ Quantum search on Hanoi network ⋮ Faster search of clustered marked states with lackadaisical quantum walks ⋮ Lackadaisical quantum walks on 2D grids with multiple marked vertices
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
- Equivalence of Szegedy's and coined quantum walks
- On the absence of homogeneous scalar unitary cellular automata.
- On the hitting times of quantum versus random walks
- Spatial search on a honeycomb network
- Spatial search and the Dirac equation
- Grover search with lackadaisical quantum walks
- Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification
- Faster quantum-walk algorithm for the two-dimensional spatial search
This page was built for publication: Faster search by lackadaisical quantum walk