.png){kind=icon}
.png){kind=icon}
Return
Quantum approximate optimization algorithm with adaptive bias fields
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.4.023249.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The quantum approximate optimization algorithm (QAOA) transforms a simple many-qubit wave function into one that encodes a solution to a difficult classical optimization problem. It does this by optimizing the schedule according to which two unitary operators are alternately applied to the qubits. In this paper, the QAOA is modified by updating the operators themselves to include local fields, using information from the measured wave function at the end of one iteration step to improve the operators at later steps. It is shown by numerical simulation on MaxCut problems that, for a fixed accuracy, this procedure decreases the runtime of QAOA very substantially. This improvement appears to increase with the problem size. Our method requires essentially the same number of quantum gates per optimization step as the standard QAOA, and no additional measurements. This modified algorithm enhances the prospects for quantum advantage for certain optimization problems.
Journal
IF:
4.2
Papers:
7.6K
Citations:
2.7W
View more organizations