.png){kind=icon}
返回
Investigating quantum approximate optimization algorithms under bang-bang protocols
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.2.033402.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The quantum approximate optimization algorithm (QAOA) is widely seen as a possible usage of noisy intermediate-scale quantum (NISQ) devices. We analyze the algorithm as a bang-bang protocol with fixed total time and a randomized greedy optimization scheme. We investigate the performance of bang-bang QAOA on MAX-2-SAT, finding the appearance of phase transitions with respect to the total time. As the total time increases, the optimal bang-bang protocol experiences a number of jumps and plateaus in performance, which match up with an increasing number of switches in the standard QAOA formulation. At large times, it becomes more difficult to find a globally optimal bang-bang protocol and performances suffer. We also investigate the effects of changing the initial conditions of the randomized optimization algorithm and see that better local optima can be found by using an adiabatic initialization.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
7.6K
被引数:
2.7W
机构
引用论文
Optimizing Variational Quantum Algorithms Using Pontryagin's Minimum Principle.png)
PHYSICAL REVIEW XOAAI
PHYSICAL REVIEW XIF15.7
OAAI分享收藏A Pilot Quantitative Study of Topographic Correlation between Reticular Pseudodrusen and the Choroidal Vasculature Using En Face Optical Coherence TomographyPLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏分享收藏
查看更多内容