Year: 2025
Type: article
Abstract: If we have to search an unsorted database or solve an unstructured search problem, we can use a quantum search algorithm [1]. As of now, a quantum search algorithm like Grover’s algorithm [2] takes Ω( N ) time, where N is the size of the search space. This paper proposes an improved quantum search algorithm that yields the correct result in constant time with a high probability.
Author: Amrita Mitra
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4417486226
