A note on the search for \(k\) elements via quantum walk
From MaRDI portal
Publication:1675772
DOI10.1016/j.ipl.2010.08.004zbMath1379.68134OpenAlexW1990736556MaRDI QIDQ1675772
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
combinatorial problemsanalysis of algorithmsrandomized algorithmsquantum walkquantum query complexity
Analysis of algorithms (68W40) Randomized algorithms (68W20) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum complexity of testing group commutativity
- 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
This page was built for publication: A note on the search for \(k\) elements via quantum walk
