.png){kind=icon}
Return
Analog quantum approximate optimization algorithm
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/ac91f0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
quantum annealers
QAOA
adiabatic evolution
hybrid algorithms
Journal
IF:
5
Papers:
1.4K
Citations:
5.1K
Organization
Cited Papers
ShareSaveElectronic structure with direct diagonalization on a D-wave quantum annealer.png)
SCIENTIFIC REPORTS
OAAI
SCIENTIFIC REPORTSIF3.9
OAAIShareSaveShareSaveShareSaveShareSaveShareSave
View more