Search algorithm on strongly regular graph by lackadaisical quantum walk
From MaRDI portal
Publication:6561797
DOI10.1088/1751-8121/ad3055zbMATH Open1548.8111MaRDI QIDQ6561797
Meng Li, Xiaoming Sun, Fangjie Peng
Publication date: 25 June 2024
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- The staggered quantum walk model
- Laplacian versus adjacency matrix in quantum walk search
- On the relationship between continuous- and discrete-time quantum walk
- Strongly regular graphs, partial geometries and partially balanced designs
- Search on vertex-transitive graphs by lackadaisical quantum walk
- Universal Computation by Multiparticle Quantum Walk
- Spatial search and the Dirac equation
- Spatial search on Johnson graphs by discrete-time quantum walk
- Quadratic speedup for finding marked vertices by Quantum walks
- Quantum walks on graphs
- Quantum Algorithms for the Triangle Problem
- Quantum Walk Algorithm for Element Distinctness
- Discretization of continuous-time quantum walks via the staggered model with Hamiltonians
- Lackadaisical discrete-time quantum walk on Johnson graph
This page was built for publication: Search algorithm on strongly regular graph by lackadaisical quantum walk
