Year: 2024
Type: article
Abstract: 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.
Source: Quantum Information Processing
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,790
OpenAlex ID: W4403536890