Simple exact quantum search

While Grover’s search algorithm is asymptotically optimal, it does not always result in a real solution. If the search fails, the algorithm must be ran again from the beginning, conditionally doubling the effective number of oracle calls. Previous research attempted to fix this issue by modifying th...

Full description

Saved in:

Bibliographic Details
Published in:	Quantum information processing Vol. 23; no. 10
Main Authors:	Guţoiu, Raj Alexandru, Tănăsescu, Andrei, Popescu, Pantelimon George
Format:	Journal Article
Language:	English
Published:	New York Springer US 18-10-2024 Springer Nature B.V
Subjects:	Data Structures and Information Theory Diffusers Mathematical Physics Optimization Physics Physics and Astronomy Quantum Computing Quantum Information Technology Quantum Physics Reflectors Search algorithms Spintronics Success rate Grover algorithm Restricted oracle Quantum search
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	While Grover’s search algorithm is asymptotically optimal, it does not always result in a real solution. If the search fails, the algorithm must be ran again from the beginning, conditionally doubling the effective number of oracle calls. Previous research attempted to fix this issue by modifying the oracle or alternating between numerically optimized reflectors. In this paper, we present an optimal initial state and reflector that produce an exact search with Grover’s algorithm at the cost of at most one additional oracle call beyond the optimum, a cost which can be nullified if we know a non-solution. We do this without modifying the oracle, without changing the diffuser at each step and even without any numerical optimization procedure required.
ISSN:	1573-1332 1570-0755 1573-1332
DOI:	10.1007/s11128-024-04548-x