arrow
Return

Low-Depth Mechanisms for Quantum Optimization

delete2021-07-21
delete23
delete
OA
AI
J
Jarrod R. McClean *
M
Matthew P. Harrigan
M
Masoud Mohseni
N
Nicholas C. Rubin
张
张江 (Jiang Zhang)
S
Sergio Boixo
V
Vadim Smelyanskiy
R
Ryan Babbush
H
Hartmut Neven
DOI:10.1103/PRXQuantum.2.030312delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
One of the major application areas of interest for both near-term and fault-tolerant quantum computers is the optimization of classical objective functions. In this work, we develop intuitive constructions for a large class of these algorithms based on connections to simple dynamics of quantum systems, quantum walks, and classical continuous relaxations. We focus on developing a language and tools connected with kinetic energy on a graph for understanding the physical mechanisms of success and failure to guide algorithmic improvement. This physical language, in combination with uniqueness results related to unitarity, allow us to identify some potential pitfalls from kinetic energy fundamentally opposing the goal of optimization. This is connected to effects from wavefunction confinement, phase randomization, and shadow defects lurking in the objective far away from the ideal solution. As an example, we explore the surprising deficiency of many quantum methods in solving uncoupled spin problems and how this is both predictive of performance on some more complex systems while immediately suggesting simple resolutions. Further examination of canonical problems like the Hamming ramp or bush of implications show that entanglement can be strictly detrimental to performance results from the underlying mechanism of solution in approaches like the quantum approximate optimization algorithm (QAOA). Kinetic energy and graph Laplacian perspectives provide new insights to common initialization and optimal solutions in QAOA as well as new methods for more effective layerwise training. Connections to classical methods of continuous extensions, homotopy methods, and iterated rounding suggest new directions for research in quantum optimization. Throughout, we unveil many pitfalls and mechanisms in quantum optimization using a physical perspective, which aim to spur the development of novel quantum optimization algorithms and refinements.
Keywords:
ALGORITHMS

Journal

P
PRX Quantum
IF:
11
Papers:
919
Citations:
9.0K

Organization

G
Google Incorporated
Scholars:
3.5K
Papers: 1.8K
Citations: 8
Cited Papers

Cited Papers

[8] Animal models for meningitis
err1994-01-01
err0
PREAI
errMartin G. Tauber; André Zwahlen
errShare
errSave
What is the Computational Value of Finite-Range Tunneling?
err2016-08-01
err316
errOAAI
errDenchev, Vasil S.; Boixo, Sergio; Isakov, Sergei V.; Ding, Nan; Babbush, Ryan; Smelyanskiy, Vadim; Martinis, John; Neven, Hartmut
errShare
errSave
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
errShare
errSave
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.
errShare
errSave
How Plants Benefit from Providing Food to Predators Even When It Is Also Edible to Herbivores
err2002-10-01
err0
errOAAI
errPaul C. J. van Rijn; Yvonne M. van Houten; Maurice W. Sabelis
errShare
errSave
Probing the C−H Activation of Linear and Cyclic Ethers at (PNP)Ir
err2009-07-10
err0
PREAI
errMatthew T. Whited; Yanjun Zhu; Samuel D. Timpa; Chun-Hsing Chen; Bruce M. Foxman; Oleg V. Ozerov; Robert H. Grubbs
errShare
errSave
researcher View more