articlePhysical Review XJun 24, 2020GOLD OA

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

LZLeo ZhouSWSheng-Tao WangSCSoonwon ChoiHPHannes PichlerMDMikhail D. Lukin

Harvard University · QuEra Computing (United States) · +2 more institutions

Indexed inarxivcrossrefdoaj

Abstract

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…

Citation impact

650
total citations
FWCI
39.17
Percentile
100%
References
55
Citations per year

Authors

5
  • LZ
    Leo ZhouCorresponding

    Harvard University

  • SW
    Sheng-Tao Wang

    Harvard University, QuEra Computing (United States)

  • SC
    Soonwon Choi

    Harvard University, University of California, Berkeley

  • HP
    Hannes Pichler

    Harvard University, Center for Astrophysics Harvard & Smithsonian

  • MD
    Mikhail D. Lukin

    Harvard University

Topics & keywords

Topics
Keywords
  • Initialization
  • Benchmark (surveying)
  • Quantum
  • Quantum annealing
  • Adiabatic process
  • Heuristic
  • Constructive
  • Simulated annealing
No related works found for this paper.

Funding