Quest for fast partial search algorithm
From MaRDI portal
Publication:850550
DOI10.1007/s11128-006-0024-3zbMath1103.68043arXivquant-ph/0510179OpenAlexW2030967155MaRDI QIDQ850550
Jinfeng Liao, Vladimir E. Korepin
Publication date: 3 November 2006
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0510179
Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items (8)
Workflow of the Grover algorithm simulation incorporating CUDA and GPGPU ⋮ Sure success partial search ⋮ HIERARCHICAL QUANTUM SEARCH ⋮ Performance analysis of the hardware-efficient quantum search algorithm ⋮ A review on quantum search algorithms ⋮ Implementation of efficient quantum search algorithms on NISQ computers ⋮ Quantum partial search of a database with several target items ⋮ Quantum partial search for uneven distribution of multiple target items
Cites Work
This page was built for publication: Quest for fast partial search algorithm
