.png){kind=icon}
返回
Quantum approximate optimization algorithm with adaptive bias fields
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.4.023249.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The quantum approximate optimization algorithm (QAOA) transforms a simple many-qubit wave function into one that encodes a solution to a difficult classical optimization problem. It does this by optimizing the schedule according to which two unitary operators are alternately applied to the qubits. In this paper, the QAOA is modified by updating the operators themselves to include local fields, using information from the measured wave function at the end of one iteration step to improve the operators at later steps. It is shown by numerical simulation on MaxCut problems that, for a fixed accuracy, this procedure decreases the runtime of QAOA very substantially. This improvement appears to increase with the problem size. Our method requires essentially the same number of quantum gates per optimization step as the standard QAOA, and no additional measurements. This modified algorithm enhances the prospects for quantum advantage for certain optimization problems.
期刊
IF:
4.2
论文数:
7.6K
被引数:
2.7W
机构
引用论文
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分享收藏Large-scale silicon quantum photonics implementing arbitrary two-qubit processing实现任意两量子位处理的大规模硅量子光子学NATURE PHOTONICSOAAI
NATURE PHOTONICSIF32.9
OAAI分享收藏
查看更多内容