Analytical framework for quantum alternating operator ansätze

Author:

Hadfield StuartORCID,Hogg Tad,Rieffel Eleanor G

Abstract

Abstract We develop a framework for analyzing layered quantum algorithms such as quantum alternating operator ansätze (QAOA). In the context of combinatorial optimization, our framework relates quantum cost gradient operators, derived from the cost and mixing Hamiltonians, to classical cost difference functions that reflect cost function neighborhood structure. By considering QAOA circuits from the Heisenberg picture, we derive exact general expressions for expectation values as series expansions in the algorithm parameters, cost gradient operators, and cost difference functions. This enables novel interpretability and insight into QAOA behavior in various parameter regimes. For single-level QAOA1 we show the leading-order changes in the output probabilities and cost expectation value explicitly in terms of classical cost differences, for arbitrary cost functions. This demonstrates that, for sufficiently small positive parameters, probability flows from lower to higher cost states on average. By selecting signs of the parameters, we can control the direction of flow. We use these results to derive a classical random algorithm emulating QAOA1 in the small-parameter regime, i.e. that produces bitstring samples with the same probabilities as QAOA1 up to small error. For deeper QAOA p circuits we apply our framework to derive analogous and additional results in several settings. In particular we show QAOA always beats random guessing. We describe how our framework incorporates cost Hamiltonian locality for specific problem classes, including causal cone approaches, and applies to QAOA performance analysis with arbitrary parameters. We illuminate our results with a number of examples including applications to QUBO problems, MaxCut, and variants of MaxSAT. We illustrate the generalization of our framework to QAOA circuits using mixing unitaries beyond the transverse-field mixer through two examples of constrained optimization problems, Max Independent Set and Graph Coloring. We conclude by outlining some of the further applications we envision for the framework.

Funder

NASA Academic Mission Services

Defense Advanced Research Projects Agency

Publisher

IOP Publishing

Subject

Electrical and Electronic Engineering,Physics and Astronomy (miscellaneous),Materials Science (miscellaneous),Atomic and Molecular Physics, and Optics

Reference87 articles.

1. Quantum search heuristics;Hogg;Phys. Rev. A,2000

2. Quantum optimization;Hogg;Inf. Sci.,2000

3. A quantum approximate optimization algorithm;Farhi,2014

4. Quantum approximate optimization with hard and soft constraints;Hadfield,2017

5. From the quantum approximate optimization algorithm to a quantum alternating operator ansatz;Hadfield;Algorithms,2019

Cited by 16 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3