Search on vertex-transitive graphs by lackadaisical quantum walk
From MaRDI portal
Publication:2681709
DOI10.1007/S11128-020-02841-ZOpenAlexW3105068153MaRDI QIDQ2681709FDOQ2681709
Authors: Mason L. Rhodes, Thomas G. Wong
Publication date: 3 February 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.11227
Recommendations
Quantum computation (81P68) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- From quantum cellular automata to quantum lattice gases
- Coins make quantum walks faster
- Title not available (Why is that?)
- Grover search with lackadaisical quantum walks
- Quantum verification of matrix products
- One-dimensional quantum walks
- Quantum walks on graphs
- Title not available (Why is that?)
- On the absence of homogeneous scalar unitary cellular automata.
- Diagrammatic approach to quantum search
- Doubling the success of quantum walk search using internal-state measurements
- Quantum algorithms for the triangle problem
- Quantum walk search on Johnson graphs
- Discrete-time quantum walk search on Johnson graphs
- Exceptional quantum walk search on the cycle
- Faster search by lackadaisical quantum walk
- Faster search of clustered marked states with lackadaisical quantum walks
- Lackadaisical quantum walks with multiple marked vertices
- Lackadaisical quantum walk for spatial search
Cited In (11)
- 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
- Graph comparison via nonlinear quantum search
- Search algorithm on strongly regular graph by lackadaisical quantum walk
- Quantum walk-based search and symmetries in graphs
- Vertices cannot be hidden from quantum spatial search for almost all random graphs
- One-dimensional lackadaisical quantum walks
- Lackadaisical discrete-time quantum walk on Johnson graph
- Grover search with lackadaisical quantum walks
- Lackadaisical quantum walks on 2D grids with multiple marked vertices
- Discrete-time quantum walk search on Johnson graphs
This page was built for publication: Search on vertex-transitive graphs by lackadaisical quantum walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2681709)