Complement Grover's Search Algorithm: An Amplitude Suppression Implementation
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Grover's search algorithm was a groundbreaking advancement in quantum algorithms, providing a quadratic speedup of querying for items. Since the creation of this algorithm it has been utilized in various ways, including in preparing specific states for a general circuit. However, as the number of desired items increases, so does the gate complexity of the sub-process that conducts the query. To counter this complexity, an extension of Grover's search algorithm is derived where the focus of the query is on the undesirable items in order to suppress the amplitude of the queried items. To display the efficacy of this extension, the algorithm is implemented as a sub-process into QAOA and applied to a traveling salesman problem. For a basis of comparison, the results are compared against QAOA.