Search algorithm on strongly regular graph by lackadaisical quantum walk
From MaRDI portal
Publication:6561797
DOI10.1088/1751-8121/AD3055zbMATH Open1548.8111MaRDI QIDQ6561797FDOQ6561797
Authors: F. J. Peng, Meng Li, Xiaoming Sun 
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 algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Cites Work
- On the relationship between continuous- and discrete-time quantum walk
- The staggered quantum walk model
- Coins make quantum walks faster
- Spatial search and the Dirac equation
- Quantum walks on graphs
- Quantum Algorithms for the Triangle Problem
- Quantum Walk Algorithm for Element Distinctness
- Universal Computation by Multiparticle Quantum Walk
- Laplacian versus adjacency matrix in quantum walk search
- Strongly regular graphs, partial geometries and partially balanced designs
- Search on vertex-transitive graphs by lackadaisical quantum walk
- Spatial search on Johnson graphs by discrete-time quantum walk
- Discretization of continuous-time quantum walks via the staggered model with Hamiltonians
- Quadratic speedup for finding marked vertices by Quantum walks
- Lackadaisical discrete-time quantum walk on Johnson graph
This page was built for publication: Search algorithm on strongly regular graph by lackadaisical quantum walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561797)
