Reachability Deficits in Quantum Approximate Optimization.
- Publisher:
- American Physical Society (APS)
- Publication Type:
- Journal Article
- Citation:
- Physical review letters, 2020, 124, (9)
- Issue Date:
- 2020-03
In Progress
Filename | Description | Size | |||
---|---|---|---|---|---|
1906.11259v2.pdf | Accepted Manuscript | 536.94 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is being processed and is not currently available.
The quantum approximate optimization algorithm (QAOA) has rapidly become a cornerstone of contemporary quantum algorithm development. Despite a growing range of applications, only a few results have been developed towards understanding the algorithm's ultimate limitations. Here we report that QAOA exhibits a strong dependence on a problem instances constraint to variable ratio-this problem density places a limiting restriction on the algorithms capacity to minimize a corresponding objective function (and hence solve optimization problem instances). Such reachability deficits persist even in the absence of barren plateaus and are outside of the recently reported level-1 QAOA limitations. These findings are among the first to determine strong limitations on variational quantum approximate optimization.
Please use this identifier to cite or link to this item: