2003/12/02 by Ahmed Younes, Jon Rowe, Julian Miller
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.1063/1.1834408
published as Proceedings of the Seventh International Conference on Quantum Communication, Measurement and Computing, pp. 171 -- 174 (2004) · 27 pages, 9 figures
arxiv created 2003/12/02 · openalex publication_date 2004/01/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
In this paper, we will define a quantum operator that performs the inversion about the mean only on a subspace of the system (partial diffusion operator). This operator is used in a quantum search algorithm that runs in O(N/M) for searching an unstructured list of size N with M matches such that, 1 ⩽ M ⩽ N. We will show that the performance of the algorithm is more reliable than known fixed operator quantum search algorithms especially for multiple matches where we can get a solution after a single iteration with probability over 90% if the number of matches is approximately more than one‐third of the search space. A performance comparison with Grover’s algorithm will be provided.