A note on the search for k elements via quantum walk

DOI10.1016/J.IPL.2010.08.004zbMATH Open1379.68134OpenAlexW1990736556MaRDI QIDQ1675772FDOQ1675772

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

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

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)

Cites Work

• Title not available (Why is that?)
• Quantum complexity of testing group commutativity
• Title not available (Why is that?)
• Quantum verification of matrix products
• Quantum algorithms revisited
• Quantum walks on graphs
• Quantum lower bounds by polynomials
• The Quantum Query Complexity of Algebraic Properties
• The Quantum Complexity of Group Testing
• Quantum algorithms for the triangle problem

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)