Simple algorithm for partial quantum search

DOI10.1007/s11128-005-0004-zzbMath1119.81030arXivquant-ph/0504157MaRDI QIDQ2491384

Lov K. Grover, Vladimir E. Korepin

Publication date: 29 May 2006

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0504157

zbMATH Keywords

quantum algorithms; search algorithms; Quantum computation

Mathematics Subject Classification ID

68P10: Searching and sorting

68P15: Database theory

81P68: Quantum computation

Related Items

QUANTUM SEARCH ALGORITHMS, Performance analysis of the hardware-efficient quantum search algorithm, Workflow of the Grover algorithm simulation incorporating CUDA and GPGPU, Optimality proofs of quantum weight decision algorithms, Multiparty controlled quantum secure direct communication based on quantum search algorithm, Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights, Tree search and quantum computation, Quest for fast partial search algorithm, Fast quantum search algorithm for databases of arbitrary size and its implementation in a cavity QED system, Quantum partial search for uneven distribution of multiple target items, Quantum partial search algorithm with smaller oracles for multiple target items, Non-local quantum functions and the distributed Deutsch-Jozsa algorithm, Quantum partial search of a database with several target items, Implementation of efficient quantum search algorithms on NISQ computers, HIERARCHICAL QUANTUM SEARCH