Quantum walk search on a two-dimensional grid with extra edges
From MaRDI portal
Publication:6164199
DOI10.1007/s10773-023-05369-xzbMath1529.81042MaRDI QIDQ6164199
Publication date: 27 July 2023
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Searching and sorting (68P10) Sums of independent random variables; random walks (60G50) Search theory (90B40) Quantum computation (81P68) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Numerical approximation of high-dimensional functions; sparse grids (65D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A review on quantum search algorithms
- Faster search by lackadaisical quantum walk
- Quantum partial search for uneven distribution of multiple target items
- Mathematical theory of duality quantum computers
- Spatial search and the Dirac equation
- Grover search with lackadaisical quantum walks
- Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Faster quantum-walk algorithm for the two-dimensional spatial search
- Quantum search on Hanoi network
- Quantum walks and search algorithms
This page was built for publication: Quantum walk search on a two-dimensional grid with extra edges
