.png){kind=icon}
返回
Analog quantum approximate optimization algorithm
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/ac91f0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
quantum annealers
QAOA
adiabatic evolution
hybrid algorithms
期刊
IF:
5
论文数:
1.4K
被引数:
5.1K
机构
引用论文
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器.png)
NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏Electronic structure with direct diagonalization on a D-wave quantum annealerSCIENTIFIC REPORTSOAAI
SCIENTIFIC REPORTSIF3.9
OAAI分享收藏
查看更多内容