.png){kind=icon}
返回
An introduction to variational quantum algorithms for combinatorial optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-024-06253-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Noisy intermediate-scale quantum computers are now readily available, motivating many researchers to experiment with Variational Quantum Algorithms. Among them, the Quantum Approximate Optimization Algorithm is one of the most popular one studied by the combinatorial optimization community. In this tutorial, we provide a mathematical description of the class of Variational Quantum Algorithms, assuming no previous knowledge of quantum physics from the readers. We introduce precisely the key aspects of these hybrid algorithms on the quantum side (parametrized quantum circuit) and the classical side (guiding function, optimizer). We devote a particular attention to QAOA, detailing the quantum circuits involved in that algorithm, as well as the properties satisfied by its possible guiding functions. Finally, we discuss the recent literature on QAOA, highlighting several research trends.
Keyword:
Variational quantum algorithm
QAOA
Combinatorial optimization
Metaheuristics
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器.png)
NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏Optimizing Variational Quantum Algorithms Using Pontryagin's Minimum PrinciplePHYSICAL REVIEW XOAAI
PHYSICAL REVIEW XIF15.7
OAAI分享收藏Short-term Stock Price Prediction by Supervised Learning of Rapid Volume Decreasing Patterns基于快速成交量下降模式的监督学习短期股票价格预测
PREAI
分享收藏
查看更多内容