Complement Grover's Search Algorithm: An Amplitude Suppression Implementation
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913198323531776 |
|---|---|
| author | Vlasic, Andrew Certo, Salvatore Pham, Anh |
| author_facet | Vlasic, Andrew Certo, Salvatore Pham, Anh |
| contents | Grover's search algorithm was a groundbreaking advancement in quantum algorithms, displaying a quadratic speed-up of querying for items. Since the creation of this algorithm it has been utilized in various ways, including in preparing specific states for the 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 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2209_10484 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Complement Grover's Search Algorithm: An Amplitude Suppression Implementation Vlasic, Andrew Certo, Salvatore Pham, Anh Quantum Physics Grover's search algorithm was a groundbreaking advancement in quantum algorithms, displaying a quadratic speed-up of querying for items. Since the creation of this algorithm it has been utilized in various ways, including in preparing specific states for the 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 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. |
| title | Complement Grover's Search Algorithm: An Amplitude Suppression Implementation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2209.10484 |