Multidimensional quantum walks
From MaRDI portal
Publication:6499291
Cites work
- scientific article; zbMATH DE number 5899238 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- scientific article; zbMATH DE number 7651029 (Why is no real title available?)
- Claw finding algorithms using quantum walk
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Exponential algorithmic speedup by a quantum walk
- Quadratic speedup for finding marked vertices by Quantum walks
- Quantum Algorithms for Element Distinctness
- Quantum Walk Algorithm for Element Distinctness
- Quantum cryptanalysis of hash and claw-free functions
- Quantum dual adversary for hidden subgroups and beyond
- Quantum lower bounds for the collision and the element distinctness problems
- Search via Quantum Walk
- Span programs for functions with constant-sized 1-certificates (extended abstract)
- The electrical resistance of a graph captures its commute and cover times
- The polynomial method strikes back: tight quantum query bounds via dual polynomials
- Time-efficient quantum walks for 3-distinctness
Cited in
(2)
This page was built for publication: Multidimensional quantum walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499291)
