Analog quantum approximate optimization algorithm
We present an analog version of the quantum approximate optimization algorithm suitable for current quantum annealers. The central idea of this algorithm is to optimize the schedule function, which defines the adiabatic evolution. It is achieved by choosing a suitable parametrization of the schedule...
| Authors: | , , , , , |
|---|---|
| Format: | article |
| Status: | Versión enviada para evaluación y publicación |
| Publication Date: | 2022 |
| Country: | España |
| Institution: | Universidad de Sevilla (US) |
| Repository: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/137335 |
| Online Access: | https://hdl.handle.net/11441/137335 https://doi.org/10.1088/2058-9565/ac91f0 |
| Access Level: | Open access |
| Keyword: | Quantum annealers QAOA Adiabatic evolution Hybrid algorithms |
| Summary: | We present an analog version of the quantum approximate optimization algorithm suitable for current quantum annealers. The central idea of this algorithm is to optimize the schedule function, which defines the adiabatic evolution. It is achieved by choosing a suitable parametrization of the schedule function based on interpolation methods for a fixed time, with the potential to generate any function. This algorithm provides an approximate result of optimization problems that may be developed during the coherence time of current quantum annealers on their way toward quantum advantage. |
|---|