Multidimensional quantum walks

DOI10.1145/3564246.3585158WikidataQ130907751 ScholiaQ130907751MaRDI QIDQ6499291FDOQ6499291

Authors: Stacey Jeffery, Sebastian Zur 

Publication date: 8 May 2024

zbMATH Keywords

quantum algorithmsquantum random walkphase estimationsuperpolynomial speedupelement distinctnesswelded trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Search via Quantum Walk
• Exponential algorithmic speedup by a quantum walk
• Quantum Walk Algorithm for Element Distinctness
• Quantum lower bounds for the collision and the element distinctness problems
• Title not available (Why is that?)
• Span programs for functions with constant-sized 1-certificates (extended abstract)
• Quantum cryptanalysis of hash and claw-free functions
• The electrical resistance of a graph captures its commute and cover times
• Title not available (Why is that?)
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Quantum Algorithms for Element Distinctness
• Time-efficient quantum walks for 3-distinctness
• Claw finding algorithms using quantum walk
• The polynomial method strikes back: tight quantum query bounds via dual polynomials
• Quadratic speedup for finding marked vertices by Quantum walks
• Quantum dual adversary for hidden subgroups and beyond
• Title not available (Why is that?)

Cited In (2)

• Perfect state transfer in quantum walks on orientable maps
• Recovering the original simplicity: succinct and exact quantum algorithm for the welded tree problem

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)