.png){kind=icon}
返回
Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.4.033029.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-classical algorithm that solves combinatorial optimization problems. While there is evidence suggesting that the fixed form of the standard QAOA Ansatz is not optimal, there is no systematic approach for finding better Ansatze. We address this problem by developing an iterative version of QAOA that is problem tailored, and which can also be adapted to specific hardware constraints. We simulate the algorithm on a class of Max-Cut graph problems and show that it converges much faster than the standard QAOA, while simultaneously reducing the required number of CNOT gates and optimization parameters. We provide evidence that this speedup is connected to the concept of shortcuts to adiabaticity.
期刊
IF:
4.2
论文数:
7.6K
被引数:
2.7W
机构
暂无机构信息
引用论文
Optimizing Variational Quantum Algorithms Using Pontryagin's Minimum Principle.png)
PHYSICAL REVIEW X
OAAI
PHYSICAL REVIEW XIF15.7
OAAI分享收藏Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator使用陷阱离子量子模拟器对远程Ising模型进行量子近似优化OAAI
OAAI分享收藏An adaptive variational algorithm for exact molecular simulations on a quantum computerNATURE COMMUNICATIONSOAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏分享收藏
查看更多内容