Publisher DOI: 10.1103/PhysRevLett.127.120502
Title: Training Variational Quantum Algorithms Is NP-Hard
Language: English
Authors: Bittel, Lennart 
Kliesch, Martin 
Issue Date: 17-Sep-2021
Source: Physical Review Letters 127 (12) : 120502 (2021-09-17)
Abstract (english): 
Variational quantum algorithms are proposed to solve relevant computational problems on near term quantum devices. Popular versions are variational quantum eigensolvers and quantum approximate optimization algorithms that solve ground state problems from quantum chemistry and binary optimization problems, respectively. They are based on the idea of using a classical computer to train a parametrized quantum circuit. We show that the corresponding classical optimization problems are NP-hard. Moreover, the hardness is robust in the sense that, for every polynomial time algorithm, there are instances for which the relative error resulting from the classical optimization problem can be arbitrarily large assuming that P≠NP. Even for classically tractable systems composed of only logarithmically many qubits or free fermions, we show the optimization to be NP-hard. This elucidates that the classical optimization is intrinsically hard and does not merely inherit the hardness from the ground state problem. Our analysis shows that the training landscape can have many far from optimal persistent local minima This means gradient and higher order descent algorithms will generally converge to far from optimal solutions.
URI: http://hdl.handle.net/11420/13620
ISSN: 0031-9007
Journal: Physical review letters 
Document Type: Article
Appears in Collections:Publications without fulltext

Show full item record

Page view(s)

22
checked on Oct 3, 2022

Google ScholarTM

Check

Add Files to Item

Note about this record

Cite this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.