Quantum search with variable times
From MaRDI portal
Publication:1959400
DOI10.1007/s00224-009-9219-1zbMath1204.68095OpenAlexW2009467529MaRDI QIDQ1959400
Publication date: 6 October 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2008/1333/
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
Quantum algorithm for triangle finding in sparse graphs ⋮ Quantum search algorithm for set operation ⋮ Improved classical and quantum algorithms for subset-sum ⋮ Quantum algorithm design: techniques and applications ⋮ Unnamed Item ⋮ Extended learning graphs for triangle finding ⋮ Unnamed Item
Cites Work
- A lower bound on the quantum query complexity of read-once functions
- Quantum complexity of testing group commutativity
- Quantum verification of matrix products
- Quantum Algorithms for Element Distinctness
- Quantum Algorithms for the Triangle Problem
- Quantum Walk Algorithm for Element Distinctness
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item