arrow
返回

Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices

delete2020-06-24
delete495
delete
OA
AI
L
Leo Zhou *
W
Wang, Sheng-Tao
C
Choi, Soonwon
P
Pichler, Hannes
L
Lukin, Mikhail D.
DOI:10.1103/PhysRevX.10.021067delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical variational algorithm designed to tackle combinatorial optimization problems. Despite its promise for near-term quantum applications, not much is currently understood about the QAOA's performance beyond its lowestdepth variant. An essential but missing ingredient for understanding and deploying the QAOA is a constructive approach to carry out the outer-loop classical optimization. We provide an in-depth study of the performance of the QAOA on MaxCut problems by developing an efficient parameter-optimization procedure and revealing its ability to exploit nonadiabatic operations. Building on observed patterns in optimal parameters, we propose heuristic strategies for initializing optimizations to find quasioptimal p-level QAOA parameters in O[poly(p)] time, whereas the standard strategy of random initialization requires 2(O)(P) optimization runs to achieve similar performance. We then benchmark the QAOA and compare it with quantum annealing, especially on difficult instances where adiabatic quantum annealing fails due to small spectral gaps. The comparison reveals that the QAOA can learn via optimization to utilize nonadiabatic mechanisms to circumvent the challenges associated with vanishing spectral gaps. Finally, we provide a realistic resource analysis on the experimental implementation of the QAOA. When quantum fluctuations in measurements are accounted for, we illustrate that optimization is important only for problem sizes beyond numerical simulations but accessible on near-term devices. We propose a feasible implementation of large MaxCut problems with a few hundred vertices in a system of 2D neutral atoms, reaching the regime to challenge the best classical algorithms.
Keyword:
COHERENT ISING MACHINE
MAX-CUT
MATRIX
DYNAMICS
LATTICE
SET
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Physical Review X 封面图
Physical Review X
IF:
15.7
论文数:
2.7K
被引数:
3.4W

机构

H
Harvard University
学者数:
26.5W
论文数: 22.0W
被引数: 28.7W
引用论文

引用论文

Microparticles induce multifactorial resistance through oncogenic pathways independently of cancer cell type
err2014-12-15
err0
errOAAI
errPaloma Silva de Souza; André L.S. Cruz; João P.B. Viola; Raquel C. Maia
err分享
err收藏
err分享
err收藏
err分享
err收藏
[8] Animal models for meningitis
err1994-01-01
err0
PREAI
errMartin G. Tauber; André Zwahlen
err分享
err收藏
Barren plateaus in quantum neural network training landscapes
err2018-11-16
err1.1K
errOAAI
errMcClean, Jarrod R.; Boixo, Sergio; Smelyanskiy, Vadim N.; Babbush, Ryan; Neven, Hartmut
err分享
err收藏
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器
err2014-07-23
err2.7K
errOAAI
errPeruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter; Yung, Man-Hong; Zhou, Xiao-Qi; Love, Peter J.; Aspuru-Guzik, Alan; O'Brien, Jeremy L.
err分享
err收藏
学者 查看更多内容