A note on the search for k elements via quantum walk

DOI10.1016/J.IPL.2010.08.004MaRDI QIDQ1675772zbMATH OpenOpenAlexFDO

Authors Sebastian Dörn, Thomas Thierauf

Publication date 3 November 2017

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2010.08.004

zbMATH Keywords

analysis of algorithmsrandomized algorithmsquantum walkcombinatorial problemsquantum query complexity

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

• Quantum Walk Algorithm for Element Distinctness
• Quantum walks can find a marked element on any graph
• Quantum Walk Based Search Algorithms
• Search via Quantum Walk
• Finding Is as Easy as Detecting for Quantum Walks

Cites work

• scientific article; zbMATH DE number 5485493 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Quantum algorithms for the triangle problem
• Quantum algorithms revisited
• Quantum complexity of testing group commutativity
• Quantum lower bounds by polynomials
• Quantum verification of matrix products
• Quantum walks on graphs
• The Quantum Complexity of Group Testing
• The Quantum Query Complexity of Algebraic Properties

Cited in

(1)

• Finding Is as Easy as Detecting for Quantum Walks

This page was built for publication: A note on the search for \(k\) elements via quantum walk

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