A unified framework of quantum walk search

DOI10.4230/LIPICS.STACS.2021.6MaRDI QIDQ7231529zbMATH OpenFDO

Authors Simon Apers, András Pal Gilyén, Stacey Jeffery

Publication date 21 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2021.6

zbMATH Keywords

graph theoryquantum algorithmsquantum walks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Coins make quantum walks faster
• Controlled Quantum Amplification
• Hamiltonian simulation with nearly optimal dependence on all parameters
• scientific article; zbMATH DE number 6131346 (Why is no real title available?)
• Improved quantum information set decoding
• Nested Quantum Walks with Quantum Data Structures
• On the hitting times of quantum versus random walks
• Quadratic speedup for finding marked vertices by Quantum walks
• Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
• Quantum algorithms for the subset-sum problem
• Quantum Algorithms for the Triangle Problem
• Quantum information set decoding algorithms
• Quantum verification of matrix products
• Quantum walks can find a marked element on any graph
• Quantum-walk speedup of backtracking algorithms
• Search via Quantum Walk
• Subset Sum Quantumly in 1.17 n .
• Time-efficient quantum walks for 3-distinctness

Cited in

(1)

• Quantum walk on a line with absorbing boundaries

This page was built for publication: A unified framework of quantum walk search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231529)