logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Analog quantum approximate optimization algorithm

delete2022-09-26
delete6
delete
OA
AI
N
N. Barraza
J
Jie Peng
L
Lucas Lamata
E
E. Solano
F
F. Albarrán-Arriagada *
DOI：10.1088/2058-9565/ac91f0delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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

Quantum Science and Technology cover
Quantum Science and Technology
IF:
5
Papers:
1.4K
Citations:
5.1K

Organization

U
University of Sevilla
Scholars:
1.9W
Papers: 1.7W
Citations: 15
X
xiangtan university
Scholars:
1.5W
Papers: 9.1K
Citations: 8
S
shanghai university
Scholars:
3.9W
Papers: 2.7W
Citations: 52
researcher View more organizations