Search on vertex-transitive graphs by lackadaisical quantum walk

DOI10.1007/S11128-020-02841-ZMaRDI QIDQ2681709zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

lackadaisical quantum walkquantum searchquantum walkspatial searchvertex transitive graph

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Recommendations

• Lackadaisical quantum walks with multiple marked vertices
• Grover search with lackadaisical quantum walks
• Faster search by lackadaisical quantum walk
• Lackadaisical quantum walks on 2D grids with multiple marked vertices
• Lackadaisical quantum walk for spatial search

Cites work

• Coins make quantum walks faster
• Diagrammatic approach to quantum search
• Discrete-time quantum walk search on Johnson graphs
• Doubling the success of quantum walk search using internal-state measurements
• Exceptional quantum walk search on the cycle
• Faster search by lackadaisical quantum walk
• Faster search of clustered marked states with lackadaisical quantum walks
• From quantum cellular automata to quantum lattice gases
• Grover search with lackadaisical quantum walks
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 5899272 (Why is no real title available?)
• scientific article; zbMATH DE number 50655 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Lackadaisical quantum walk for spatial search
• Lackadaisical quantum walks with multiple marked vertices
• On the absence of homogeneous scalar unitary cellular automata.
• One-dimensional quantum walks
• Quantum algorithms for the triangle problem
• Quantum verification of matrix products
• Quantum walk search on Johnson graphs
• Quantum walks on graphs

Cited in

(14)

• Vertices cannot be hidden from quantum spatial search for almost all random graphs
• 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
• Quantum walk-based search and symmetries in graphs
• Grover search with lackadaisical quantum walks
• One-dimensional lackadaisical quantum walks
• Lackadaisical quantum walks on 2D grids with multiple marked vertices
• Lackadaisical discrete-time quantum walk on Johnson graph
• Search algorithm on strongly regular graph by lackadaisical quantum walk
• Discrete-time quantum walk search on Johnson graphs
• Discrete-time quantum walk search on the cycle graph with weighted self-loop
• Multi-target quantum walk search on Johnson graph
• Quantum spatial best-arm identification on a complete bipartite graph

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)