Multidimensional quantum walks
From MaRDI portal
Publication:6499291
DOI10.1145/3564246.3585158WikidataQ130907751 ScholiaQ130907751MaRDI QIDQ6499291
Publication date: 8 May 2024
quantum algorithmsquantum random walkphase estimationsuperpolynomial speedupelement distinctnesswelded trees
Cites Work
- Claw finding algorithms using quantum walk
- The electrical resistance of a graph captures its commute and cover times
- Quantum dual adversary for hidden subgroups and beyond
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Search via Quantum Walk
- Quantum lower bounds for the collision and the element distinctness problems
- Exponential algorithmic speedup by a quantum walk
- Quadratic speedup for finding marked vertices by Quantum walks
- The polynomial method strikes back: tight quantum query bounds via dual polynomials
- Quantum Algorithms for Element Distinctness
- Time-Efficient Quantum Walks for 3-Distinctness
- Span programs for functions with constant-sized 1-certificates
- Quantum Walk Algorithm for Element Distinctness
- Quantum cryptanalysis of hash and claw-free functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multidimensional quantum walks
